Circular coloring and Mycielski construction

DOI10.1016/j.disc.2010.01.019zbMath1221.05124arXiv0904.1319MaRDI QIDQ968430

Hossein Hajiabolhassan, Meysam Alishahi

Publication date: 5 May 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0904.1319

zbMATH Keywords

graph coloring; graph homomorphism; circular coloring; Mycielski construction

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

Related Items

A generalization of Kneser's conjecture, On the chromatic number of general Kneser hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complete intersection theorem for systems of finite sets
• Kneser's conjecture, chromatic number, and homotopy
• The exact bound in the Erdős-Ko-Rado theorem
• Local chromatic number, Ky Fan's theorem, and circular colorings
• On the diameter of generalized Kneser graphs
• Circular chromatic numbers of Mycielski's graphs
• The odd girth of the generalised Kneser graph
• Circular chromatic number of Kneser graphs
• Circular chromatic number for iterated Mycielski graphs
• Circular colouring and algebraic no-homomorphism theorems
• Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the chromatic number of the general Kneser-graph
• Star chromatic number
• Star chromatic numbers and products of graphs
• Circular chromatic number and Mycielski construction
• A topological lower bound for the circular chromatic number of Schrijver graphs
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Sur le coloriage des graphs
• Circular chromatic number and Mycielski graphs
• Circular chromatic number: A survey