Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function

DOI10.1002/JGT.20117MaRDI QIDQ3376687zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Claude Tardif, David Wehlau

Publication date 24 March 2006

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20117

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Chromatic numbers and products
• The fractional chromatic number of the categorical product of graphs
• scientific article; zbMATH DE number 37867
• The chromatic number of the product of two 4-chromatic graphs is 4
• scientific article; zbMATH DE number 4093485

Cited in

(10)

• Hedetniemi's conjecture and adjoint functors in thin categories
• The fractional chromatic number of the categorical product of graphs
• Digraphs products
• Zero-sum flow number of categorical and strong product of graphs
• Hedetniemi's conjecture and dense Boolean lattices
• Zero-sum flow number of octagonal grid and generalized prism
• Adaptable chromatic number of graph products
• Note on Hedetniemi's conjecture and the Poljak-Rödl function
• On edge irregular total labeling of categorical product of two cycles
• Interleaved adjoints of directed graphs

This page was built for publication: Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3376687)