Connectedness of Strong k-Colour Graphs

Details Connectedness of Strong k-Colour Graphs Connectedness of Strong k-Colour Graphs

2010-09-22

arxiv.org/abs/1009.4440v1

Mathematics

Combinatorics

15 pages

Scientific paper

For a positive integer k and a graph G, we consider proper vertex-colourings of G with k colours in which all k colours are actually used. We call such a colouring a strong k-colouring. The strong k-colour graph of G, S_k(G), is the graph that has all the strong k-colourings of G as its vertex set, and two colourings are adjacent in S_k(G) if they differ in colour on only one vertex of G. In this paper, we show some results related to the question : For what G and k is S_k(G) connected ?

Affiliated with

Also associated with

No associations

Rating

Connectedness of Strong k-Colour Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Connectedness of Strong k-Colour Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Connectedness of Strong k-Colour Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-638428