Given a X(G) coloring of the graph G, is it possible to find every other possible X(G)-coloring of G?
up vote
1
down vote
favorite
Given a coloring of the graph $G$ using $chi(G)$ (the chromatic number of $G$) colors is it possible to find every other $chi(G)$-coloring of $G$? One way of finding other $chi(G)$-coloring of $G$ is by swapping 2 or more colors from the given coloring of $G$, an other way is by using Kempe chain recoloring. Are those two way of recoloring going to give me every possible $chi(G)$-coloring of $G$? Is there a proof or a counter-proof to it? Is there other ways of recoloring without increasing the number of color used?
graph-theory coloring
edited Nov 20 at 1:10
mathnoob
67511
asked Nov 6 '16 at 11:16
Andrea Nardi
62
add a comment |
up vote
1
down vote
favorite
Given a coloring of the graph $G$ using $chi(G)$ (the chromatic number of $G$) colors is it possible to find every other $chi(G)$-coloring of $G$? One way of finding other $chi(G)$-coloring of $G$ is by swapping 2 or more colors from the given coloring of $G$, an other way is by using Kempe chain recoloring. Are those two way of recoloring going to give me every possible $chi(G)$-coloring of $G$? Is there a proof or a counter-proof to it? Is there other ways of recoloring without increasing the number of color used?
graph-theory coloring
edited Nov 20 at 1:10
mathnoob
67511
asked Nov 6 '16 at 11:16
Andrea Nardi
62
Is the graph connected?
– bof
Nov 20 at 3:26
What about the "friendship graph" $F_n$?
– bof
Nov 20 at 3:27
@bof Yes, the graph is connected. I think that even if a graph is not connected, a method can be inferred by analyzing each connected component of the graph individually.
– Andrea Nardi
2 days ago
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Given a coloring of the graph $G$ using $chi(G)$ (the chromatic number of $G$) colors is it possible to find every other $chi(G)$-coloring of $G$? One way of finding other $chi(G)$-coloring of $G$ is by swapping 2 or more colors from the given coloring of $G$, an other way is by using Kempe chain recoloring. Are those two way of recoloring going to give me every possible $chi(G)$-coloring of $G$? Is there a proof or a counter-proof to it? Is there other ways of recoloring without increasing the number of color used?
graph-theory coloring
edited Nov 20 at 1:10
mathnoob
67511
asked Nov 6 '16 at 11:16
Andrea Nardi
62
Given a coloring of the graph $G$ using $chi(G)$ (the chromatic number of $G$) colors is it possible to find every other $chi(G)$-coloring of $G$? One way of finding other $chi(G)$-coloring of $G$ is by swapping 2 or more colors from the given coloring of $G$, an other way is by using Kempe chain recoloring. Are those two way of recoloring going to give me every possible $chi(G)$-coloring of $G$? Is there a proof or a counter-proof to it? Is there other ways of recoloring without increasing the number of color used?
graph-theory coloring
graph-theory coloring
edited Nov 20 at 1:10
mathnoob
67511
asked Nov 6 '16 at 11:16
Andrea Nardi
62
edited Nov 20 at 1:10
mathnoob
67511
asked Nov 6 '16 at 11:16
Andrea Nardi
62
edited Nov 20 at 1:10
mathnoob
67511
edited Nov 20 at 1:10
mathnoob
67511
edited Nov 20 at 1:10
mathnoob
67511
67511
asked Nov 6 '16 at 11:16
Andrea Nardi
62
asked Nov 6 '16 at 11:16
Andrea Nardi
62
asked Nov 6 '16 at 11:16
Andrea Nardi
62
62
Is the graph connected?
– bof
Nov 20 at 3:26
What about the "friendship graph" $F_n$?
– bof
Nov 20 at 3:27
@bof Yes, the graph is connected. I think that even if a graph is not connected, a method can be inferred by analyzing each connected component of the graph individually.
– Andrea Nardi
2 days ago
add a comment |
Is the graph connected?
– bof
Nov 20 at 3:26
What about the "friendship graph" $F_n$?
– bof
Nov 20 at 3:27
@bof Yes, the graph is connected. I think that even if a graph is not connected, a method can be inferred by analyzing each connected component of the graph individually.
– Andrea Nardi
2 days ago
Is the graph connected?
– bof
Nov 20 at 3:26
Is the graph connected?
– bof
Nov 20 at 3:26
What about the "friendship graph" $F_n$?
– bof
Nov 20 at 3:27
What about the "friendship graph" $F_n$?
– bof
Nov 20 at 3:27
@bof Yes, the graph is connected. I think that even if a graph is not connected, a method can be inferred by analyzing each connected component of the graph individually.
– Andrea Nardi
2 days ago
@bof Yes, the graph is connected. I think that even if a graph is not connected, a method can be inferred by analyzing each connected component of the graph individually.
– Andrea Nardi
2 days ago
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2001782%2fgiven-a-xg-coloring-of-the-graph-g-is-it-possible-to-find-every-other-possibl%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Is the graph connected?
– bof
Nov 20 at 3:26
What about the "friendship graph" $F_n$?
– bof
Nov 20 at 3:27
@bof Yes, the graph is connected. I think that even if a graph is not connected, a method can be inferred by analyzing each connected component of the graph individually.
– Andrea Nardi
2 days ago