Graph homomorphisms into the five-cycle

DOI10.1016/0095-8956(88)90069-XzbMath0649.05056OpenAlexW2068057399MaRDI QIDQ1105622

Paul A. Catlin

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90069-x

zbMATH Keywords

graph homomorphism\(C_ 5\)-coloring of a graphsubgraph homeomorphic to \(K_ 4\)

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)

Related Items (4)

On the odd girth and the circular chromatic number of generalized Petersen graphs ⋮ Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\) ⋮ Unique graph homomorphisms onto odd cycles. II ⋮ Density of \(C_{-4}\)-critical signed graphs

Cites Work

• Hajos' graph-coloring conjecture: Variations and counterexamples
• Homomorphisms of graphs into odd cycles
• A correction to: On the algebraic theory of graph colorings
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph homomorphisms into the five-cycle