Mixing
Given a X(G) coloring of the graph G, is it possible to find every other possible X(G)-coloring of G?
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 '18 at 1:10
mathnoob
1,799422
asked Nov 6 '16 at 11:16
Andrea Nardi
62
add a comment |
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 '18 at 1:10
mathnoob
1,799422
asked Nov 6 '16 at 11:16
Andrea Nardi
62
Is the graph connected?
– bof
Nov 20 '18 at 3:26
What about the "friendship graph" $F_n$?
– bof
Nov 20 '18 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
Nov 20 '18 at 14:03
add a comment |
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 '18 at 1:10
mathnoob
1,799422
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 '18 at 1:10
mathnoob
1,799422
asked Nov 6 '16 at 11:16
Andrea Nardi
62
edited Nov 20 '18 at 1:10
mathnoob
1,799422
asked Nov 6 '16 at 11:16
Andrea Nardi
62
edited Nov 20 '18 at 1:10
mathnoob
1,799422
edited Nov 20 '18 at 1:10
mathnoob
1,799422
edited Nov 20 '18 at 1:10
mathnoob
1,799422
1,799422
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 '18 at 3:26
What about the "friendship graph" $F_n$?
– bof
Nov 20 '18 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
Nov 20 '18 at 14:03
add a comment |
Is the graph connected?
– bof
Nov 20 '18 at 3:26
What about the "friendship graph" $F_n$?
– bof
Nov 20 '18 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
Nov 20 '18 at 14:03
Is the graph connected?
– bof
Nov 20 '18 at 3:26
Is the graph connected?
– bof
Nov 20 '18 at 3:26
What about the "friendship graph" $F_n$?
– bof
Nov 20 '18 at 3:27
What about the "friendship graph" $F_n$?
– bof
Nov 20 '18 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
Nov 20 '18 at 14:03
@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
Nov 20 '18 at 14:03
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
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 '18 at 3:26
What about the "friendship graph" $F_n$?
– bof
Nov 20 '18 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
Nov 20 '18 at 14:03