A graph-coloring problem where only some of the edges should be bichromatic
$begingroup$
In a standard graph-coloring problem, it is required that all edges will be bichromatic (i.e., all edges should be connected to two vertices with different colors). What is a term, and some basic references, for a graph-coloring problem in which only a fraction of the edges should satisfy this condition? For example, at least $frac23$ or at least $frac12$?
I looked for "fractional coloring" but, apparently, it is a completely different problem.
graph-theory reference-request terminology coloring
$endgroup$
|
show 1 more comment
$begingroup$
In a standard graph-coloring problem, it is required that all edges will be bichromatic (i.e., all edges should be connected to two vertices with different colors). What is a term, and some basic references, for a graph-coloring problem in which only a fraction of the edges should satisfy this condition? For example, at least $frac23$ or at least $frac12$?
I looked for "fractional coloring" but, apparently, it is a completely different problem.
graph-theory reference-request terminology coloring
$endgroup$
$begingroup$
"Partial proper colouring
", maybe?
$endgroup$
– EdOverflow
Jan 6 at 20:49
$begingroup$
what does bichromatic mean?
$endgroup$
– nafhgood
Jan 7 at 1:05
$begingroup$
@mathnoob I added an explanation
$endgroup$
– Erel Segal-Halevi
Jan 7 at 3:53
$begingroup$
@EdOverflow I found this expression here: arxiv.org/pdf/1810.06704.pdf If I understand correctly, it refers to coloring in which only some of the vertices are colored, while others are not colored at all.
$endgroup$
– Erel Segal-Halevi
Jan 7 at 4:18
$begingroup$
@erel-segal-halevi, yes, although the bichromatic property still holds for those that are coloured. I think the only downside to the term I suggested is that it implies the remaining vertices are not coloured at all (or not necessarily coloured). Maybe you could combine the termsproper colouring
andsubgraphs
to describe what you are after above. I would need to look into this a bit more before I can suggest a more concrete term.
$endgroup$
– EdOverflow
Jan 7 at 19:08
|
show 1 more comment
$begingroup$
In a standard graph-coloring problem, it is required that all edges will be bichromatic (i.e., all edges should be connected to two vertices with different colors). What is a term, and some basic references, for a graph-coloring problem in which only a fraction of the edges should satisfy this condition? For example, at least $frac23$ or at least $frac12$?
I looked for "fractional coloring" but, apparently, it is a completely different problem.
graph-theory reference-request terminology coloring
$endgroup$
In a standard graph-coloring problem, it is required that all edges will be bichromatic (i.e., all edges should be connected to two vertices with different colors). What is a term, and some basic references, for a graph-coloring problem in which only a fraction of the edges should satisfy this condition? For example, at least $frac23$ or at least $frac12$?
I looked for "fractional coloring" but, apparently, it is a completely different problem.
graph-theory reference-request terminology coloring
graph-theory reference-request terminology coloring
edited Jan 7 at 3:52
Erel Segal-Halevi
asked Jan 6 at 19:51
Erel Segal-HaleviErel Segal-Halevi
4,24611760
4,24611760
$begingroup$
"Partial proper colouring
", maybe?
$endgroup$
– EdOverflow
Jan 6 at 20:49
$begingroup$
what does bichromatic mean?
$endgroup$
– nafhgood
Jan 7 at 1:05
$begingroup$
@mathnoob I added an explanation
$endgroup$
– Erel Segal-Halevi
Jan 7 at 3:53
$begingroup$
@EdOverflow I found this expression here: arxiv.org/pdf/1810.06704.pdf If I understand correctly, it refers to coloring in which only some of the vertices are colored, while others are not colored at all.
$endgroup$
– Erel Segal-Halevi
Jan 7 at 4:18
$begingroup$
@erel-segal-halevi, yes, although the bichromatic property still holds for those that are coloured. I think the only downside to the term I suggested is that it implies the remaining vertices are not coloured at all (or not necessarily coloured). Maybe you could combine the termsproper colouring
andsubgraphs
to describe what you are after above. I would need to look into this a bit more before I can suggest a more concrete term.
$endgroup$
– EdOverflow
Jan 7 at 19:08
|
show 1 more comment
$begingroup$
"Partial proper colouring
", maybe?
$endgroup$
– EdOverflow
Jan 6 at 20:49
$begingroup$
what does bichromatic mean?
$endgroup$
– nafhgood
Jan 7 at 1:05
$begingroup$
@mathnoob I added an explanation
$endgroup$
– Erel Segal-Halevi
Jan 7 at 3:53
$begingroup$
@EdOverflow I found this expression here: arxiv.org/pdf/1810.06704.pdf If I understand correctly, it refers to coloring in which only some of the vertices are colored, while others are not colored at all.
$endgroup$
– Erel Segal-Halevi
Jan 7 at 4:18
$begingroup$
@erel-segal-halevi, yes, although the bichromatic property still holds for those that are coloured. I think the only downside to the term I suggested is that it implies the remaining vertices are not coloured at all (or not necessarily coloured). Maybe you could combine the termsproper colouring
andsubgraphs
to describe what you are after above. I would need to look into this a bit more before I can suggest a more concrete term.
$endgroup$
– EdOverflow
Jan 7 at 19:08
$begingroup$
"
Partial proper colouring
", maybe?$endgroup$
– EdOverflow
Jan 6 at 20:49
$begingroup$
"
Partial proper colouring
", maybe?$endgroup$
– EdOverflow
Jan 6 at 20:49
$begingroup$
what does bichromatic mean?
$endgroup$
– nafhgood
Jan 7 at 1:05
$begingroup$
what does bichromatic mean?
$endgroup$
– nafhgood
Jan 7 at 1:05
$begingroup$
@mathnoob I added an explanation
$endgroup$
– Erel Segal-Halevi
Jan 7 at 3:53
$begingroup$
@mathnoob I added an explanation
$endgroup$
– Erel Segal-Halevi
Jan 7 at 3:53
$begingroup$
@EdOverflow I found this expression here: arxiv.org/pdf/1810.06704.pdf If I understand correctly, it refers to coloring in which only some of the vertices are colored, while others are not colored at all.
$endgroup$
– Erel Segal-Halevi
Jan 7 at 4:18
$begingroup$
@EdOverflow I found this expression here: arxiv.org/pdf/1810.06704.pdf If I understand correctly, it refers to coloring in which only some of the vertices are colored, while others are not colored at all.
$endgroup$
– Erel Segal-Halevi
Jan 7 at 4:18
$begingroup$
@erel-segal-halevi, yes, although the bichromatic property still holds for those that are coloured. I think the only downside to the term I suggested is that it implies the remaining vertices are not coloured at all (or not necessarily coloured). Maybe you could combine the terms
proper colouring
and subgraphs
to describe what you are after above. I would need to look into this a bit more before I can suggest a more concrete term.$endgroup$
– EdOverflow
Jan 7 at 19:08
$begingroup$
@erel-segal-halevi, yes, although the bichromatic property still holds for those that are coloured. I think the only downside to the term I suggested is that it implies the remaining vertices are not coloured at all (or not necessarily coloured). Maybe you could combine the terms
proper colouring
and subgraphs
to describe what you are after above. I would need to look into this a bit more before I can suggest a more concrete term.$endgroup$
– EdOverflow
Jan 7 at 19:08
|
show 1 more comment
0
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%2f3064330%2fa-graph-coloring-problem-where-only-some-of-the-edges-should-be-bichromatic%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
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.
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%2f3064330%2fa-graph-coloring-problem-where-only-some-of-the-edges-should-be-bichromatic%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
$begingroup$
"
Partial proper colouring
", maybe?$endgroup$
– EdOverflow
Jan 6 at 20:49
$begingroup$
what does bichromatic mean?
$endgroup$
– nafhgood
Jan 7 at 1:05
$begingroup$
@mathnoob I added an explanation
$endgroup$
– Erel Segal-Halevi
Jan 7 at 3:53
$begingroup$
@EdOverflow I found this expression here: arxiv.org/pdf/1810.06704.pdf If I understand correctly, it refers to coloring in which only some of the vertices are colored, while others are not colored at all.
$endgroup$
– Erel Segal-Halevi
Jan 7 at 4:18
$begingroup$
@erel-segal-halevi, yes, although the bichromatic property still holds for those that are coloured. I think the only downside to the term I suggested is that it implies the remaining vertices are not coloured at all (or not necessarily coloured). Maybe you could combine the terms
proper colouring
andsubgraphs
to describe what you are after above. I would need to look into this a bit more before I can suggest a more concrete term.$endgroup$
– EdOverflow
Jan 7 at 19:08