Circular colouring and algebraic no-homomorphism theorems
From MaRDI portal
Publication:2372443
DOI10.1016/j.ejc.2006.04.010zbMath1247.05077MaRDI QIDQ2372443
Hossein Hajiabolhassan, Amir Daneshgar
Publication date: 27 July 2007
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2006.04.010
05C15: Coloring of graphs and hypergraphs
Related Items
On defining numbers of circular complete graphs, Density and power graphs in graph homomorphism problem, A new class of transitive graphs, Circular coloring and Mycielski construction, On the isoperimetric spectrum of graphs and its approximations, On colorings of graph powers, On the Circular Chromatic Number of Graph Powers
Cites Work