Regular graphs with no homomorphisms onto cycles

DOI10.1006/jctb.2000.2014zbMath1027.05087OpenAlexW2098215184MaRDI QIDQ1850540

Nicholas C. Wormald, Ian M. Wanless

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2000.2014

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38)

Related Items (7)

On the odd girth and the circular chromatic number of generalized Petersen graphs ⋮ Density and power graphs in graph homomorphism problem ⋮ Circular coloring of random graphs: statistical physics investigation ⋮ Random cubic graphs are not homomorphic to the cycle of size 7 ⋮ High-girth cubic graphs are homomorphic to the Clebsch graph ⋮ On colorings of graph powers ⋮ Cuts and bounds

Cites Work

• Unique graph homomorphisms onto odd cycles. II
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular graphs with no homomorphisms onto cycles