0

0

 Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function
 摘  要: Abstract: Let f(n) ? minf (G H ) : G and H are n-chromatic digraphsg and g(n) ? minf (G H ) : G and H are n-chromatic graphs}. We prove that f is bounded if and only if g is bounded. 2005 Wiley Periodicals, Inc. J Graph Theory 51: 33-36, 2006 Keywords: categorical product; Hedetniemi's conjecture; chromatic number; Poljak-Ro¨dl function
 发  表:

 论文统计图 .axis path, .axis line { fill: none; stroke: #000; shape-rendering: crispEdges; } .line { fill: none; stroke-width: 1.5px; }
 共享有6个版本  [展开全部版本] [收起版本] http://doi.wiley.com/10.1002/jgt.20117 http://www.informatik.uni-trier.de/~ley/db/journals/jgt/jgt51.html#TardifW06 http://www.mast.queensu.ca/~wehlau/published_versions/prf.pdf
 Bibtex @article{ author = {Claude Tardif and David L. Wehlau}, title = {Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function}, journal = {Journal of Graph Theory}, volume = {51}, year = {2006}, pages = {33--36}, issue = {1}, doi = {10.1002/jgt.20117} }

 还没有人点评哦

 Total Weight Choosability of Graphs The rainbow connection of a graph is (at most) reciprocal to its minimum degree Path homomorphisms, graph colorings, and boolean matrices On optimizing edge connectivity of product graphs Interleaved adjoints on directed graphs On directed local chromatic number, shift graphs, and Borsuk-like graphs A dualistic approach to bounding the chromatic number of a graph Acyclic edge chromatic number of outerplanar graphs Hadwiger number and chromatic number for near regular degree sequences Interleaved adjoints of directed graphs