On the Circular Chromatic Number of Graph Powers

DOI10.1002/jgt.21722zbMath1280.05087arXiv1104.4411OpenAlexW1916421046MaRDI QIDQ2874089

Ali Taherkhani, Hossein Hajiabolhassan

Publication date: 28 January 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

fractional chromatic numbergraph homomorphismcircular coloringmultichromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

On the odd girth and the circular chromatic number of generalized Petersen graphs

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• On colorings of graph powers
• The multichromatic numbers of some Kneser graphs
• Circular colouring and algebraic no-homomorphism theorems
• Graph powers and graph homomorphisms
• Multiplicative graphs and semi-lattice endomorphisms in the category of graphs
• Girth and fractional chromatic number of planar graphs
• Multichromatic numbers, star chromatic numbers and Kneser graphs
• Circular chromatic number of subgraphs
• The fractional chromatic number of mycielski's graphs
• Circular chromatic number: A survey

This page was built for publication: On the Circular Chromatic Number of Graph Powers