Circular colouring and graph homomorphism

DOI10.1017/S0004972700032627zbMath0923.05025MaRDI QIDQ4243353

Xuding Zhu

Publication date: 28 October 1999

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

homomorphismstar chromatic numbercircular chromatic numbersedge delation

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

On defining numbers of circular complete graphs ⋮ The circular chromatic number of series-parallel graphs with large girth ⋮ Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$ ⋮ Minimal circular-imperfect graphs of large clique number and large independence number ⋮ On sparse graphs with given colorings and homomorphisms. ⋮ Resource-sharing system scheduling and circular chromatic number ⋮ Circular chromatic numbers of Mycielski's graphs ⋮ Planar graphs with circular chromatic numbers between 3 and 4

Cites Work

• Symmetric graphs and interpretations
• Color-families are dense
• Lattices arising in categorial investigations of Hedetniemi's conjecture
• Star chromatic numbers of graphs
• A note on the star chromatic number
• Star chromatic number
• Star chromatic numbers and products of graphs
• The star chromatic number of a graph
• Acyclic graph coloring and the complexity of the star chromatic number
• Path homomorphisms

This page was built for publication: Circular colouring and graph homomorphism