Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function
From MaRDI portal
Publication:3376687
DOI10.1002/jgt.20117zbMath1132.05024OpenAlexW4251397716WikidataQ64356950 ScholiaQ64356950MaRDI QIDQ3376687
David L. Wehlau, Claude Tardif
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
Related Items (9)
Zero-sum flow number of categorical and strong product of graphs ⋮ Hedetniemi's conjecture and dense Boolean lattices ⋮ On edge irregular total labeling of categorical product of two cycles ⋮ Interleaved adjoints of directed graphs ⋮ Zero-sum flow number of octagonal grid and generalized prism ⋮ Hedetniemi's conjecture and adjoint functors in thin categories ⋮ Note on Hedetniemi's conjecture and the Poljak-Rödl function ⋮ Adaptable chromatic number of graph products ⋮ Digraphs Products
Cites Work
This page was built for publication: Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function
