Publication:4892340
From MaRDI portal
DOI<33::AID-JGT3>3.0.CO;2-L 10.1002/(SICI)1097-0118(199609)23:1<33::AID-JGT3>3.0.CO;2-LzbMath0864.05037MaRDI QIDQ4892340
Publication date: 22 June 1997
05C15: Coloring of graphs and hypergraphs
Related Items
Unnamed Item, Unnamed Item, Circular Chromatic Indices of Regular Graphs, Triangle-free subgraphs with large fractional chromatic number, Dualities and dual pairs in Heyting algebras, Circular total chromatic numbers of graphs, The good, the bad, and the great: homomorphisms and cores of random graphs, Circular chromatic numbers of Mycielski's graphs, Homomorphisms and amalgamation, On sparse graphs with given colorings and homomorphisms., Circular chromatic indices of even degree regular graphs, Cuts and bounds, An analogue of Hajós’ Theorem for the circular chromatic number