Graph homomorphisms into the five-cycle (Q1105622): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3758851 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5782525 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hajos' graph-coloring conjecture: Variations and counterexamples / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Homomorphisms of graphs into odd cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5578801 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A correction to: On the algebraic theory of graph colorings / rank | |||
Normal rank | |||
Revision as of 17:04, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph homomorphisms into the five-cycle |
scientific article |
Statements
Graph homomorphisms into the five-cycle (English)
0 references
1988
0 references
\textit{A. M. H. Gerards} [J. Graph Theory 12, 73-83 (1988)] proved that if a graph G with odd girth n does not admit a homomorphism into the cycle \(C_ n\) then G contains a special subdivision of \(K_ 4\) or \(K\) \(2_ 3\). The author presents a constructive characterization of those graphs which have no homomorphism into the cycle \(C_ 5\) and contain no subdivision of \(K_ 4\).
0 references
graph homomorphism
0 references
\(C_ 5\)-coloring of a graph
0 references
subgraph homeomorphic to \(K_ 4\)
0 references
