Circular colouring and graph homomorphism

DOI10.1017/S0004972700032627zbMATH Open0923.05025MaRDI QIDQ4243353FDOQ4243353

Authors: Xuding Zhu 

Publication date: 28 October 1999

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

Recommendations

• Some results on circular chromatic number of a graph
• On the circular chromatic number of circular partitionable graphs
• Circular chromatic Ramsey number
• scientific article
• Graphs whose circular chromatic number equals the chromatic number

zbMATH Keywords

homomorphismstar chromatic numbercircular chromatic numbersedge delation

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

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

Cited In (23)

• Circular chromatic number of triangle-free hexagonal graphs
• Minimal circular-imperfect graphs of large clique number and large independence number
• Circular chromatic numbers of Mycielski's graphs
• On defining numbers of circular complete graphs
• Title not available (Why is that?)
• Density and power graphs in graph homomorphism problem
• A dichotomy theorem for circular colouring reconfiguration
• The circular chromatic number of series-parallel graphs with large girth
• Graph powers and graph homomorphisms
• Title not available (Why is that?)
• On the circular chromatic number of circular partitionable graphs
• Some results on circular chromatic number of a graph
• Colouring clique-hypergraphs of circulant graphs
• On the circular altitude of graphs
• Circular chromatic number of triangle-free hexagonal graphs
• Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$
• Title not available (Why is that?)
• Resource-sharing system scheduling and circular chromatic number
• On sparse graphs with given colorings and homomorphisms.
• Title not available (Why is that?)
• Construction of \(K_{n}\)-minor free graphs with given circular chromatic number
• Planar graphs with circular chromatic numbers between 3 and 4
• Circular colouring and algebraic no-homomorphism theorems

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

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