DC Field | Value | Language |
---|---|---|
dc.contributor.author | Godsil, Chris | ko |
dc.contributor.author | Roberson, David E. | ko |
dc.contributor.author | Rooney, Brendan | ko |
dc.contributor.author | Samal, Robert | ko |
dc.contributor.author | Varvitsiotis, Antonios | ko |
dc.date.accessioned | 2021-03-26T02:52:58Z | - |
dc.date.available | 2021-03-26T02:52:58Z | - |
dc.date.created | 2020-07-15 | - |
dc.date.issued | 2020-07 | - |
dc.identifier.citation | MATHEMATICAL PROGRAMMING, v.182, no.1-2, pp.275 - 314 | - |
dc.identifier.issn | 0025-5610 | - |
dc.identifier.uri | http://hdl.handle.net/10203/281984 | - |
dc.description.abstract | A vector t-coloring of a graph is an assignment of real vectors p(1), ... , p(n) to its vertices such that p(i)(T) p(i) = t - 1, for all i = 1, ... , n and p(i)(T) p(j) <= -1, whenever i and j are adjacent. The vector chromatic number of G is the smallest number t >= 1 for which a vector t-coloring of G exists. For a graph H and a vector t-coloring p(1), ... , p(n) of G, the map taking (i, l) is an element of V(G) x V(H) to p(i) is a vector t-coloring of the categorical product G x H. It follows that the vector chromatic number of G x H is at most the minimum of the vector chromatic numbers of the factors. We prove that equality always holds, constituting a vector coloring analog of the famous Hedetniemi Conjecture from graph coloring. Furthermore, we prove necessary and sufficient conditions under which all optimal vector colorings of G x H are induced by optimal vector colorings of the factors. Our proofs rely on various semidefinite programming formulations of the vector chromatic number and a theory of optimal vector colorings we develop along the way, which is of independent interest. | - |
dc.language | English | - |
dc.publisher | SPRINGER HEIDELBERG | - |
dc.title | Vector coloring the categorical product of graphs | - |
dc.type | Article | - |
dc.identifier.wosid | 000542402700009 | - |
dc.identifier.scopusid | 2-s2.0-85064644851 | - |
dc.type.rims | ART | - |
dc.citation.volume | 182 | - |
dc.citation.issue | 1-2 | - |
dc.citation.beginningpage | 275 | - |
dc.citation.endingpage | 314 | - |
dc.citation.publicationname | MATHEMATICAL PROGRAMMING | - |
dc.identifier.doi | 10.1007/s10107-019-01393-0 | - |
dc.contributor.nonIdAuthor | Godsil, Chris | - |
dc.contributor.nonIdAuthor | Roberson, David E. | - |
dc.contributor.nonIdAuthor | Samal, Robert | - |
dc.contributor.nonIdAuthor | Varvitsiotis, Antonios | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Vector coloring | - |
dc.subject.keywordAuthor | Lovasz nu number | - |
dc.subject.keywordAuthor | Categorical graph product | - |
dc.subject.keywordAuthor | Semidefinite programming | - |
dc.subject.keywordAuthor | Hedetniemi&apos | - |
dc.subject.keywordAuthor | s conjecture | - |
dc.subject.keywordPlus | CHROMATIC NUMBER | - |
dc.subject.keywordPlus | DELSARTE | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.