Special subdivisions of \(K_4\) and 4-chromatic graphs

DOI10.1007/BF01476588zbMath0421.05025OpenAlexW2021065281MaRDI QIDQ1132888

Uffe Krusenstjerna-Hafstrom, Bjarne Toft

Publication date: 1980

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/177957

zbMATH Keywords

Hamiltonian path4-chromatic graphsextremal resultK3-cocadesspecial subdivisions of K4

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Cycle lengths and minimum degree of graphs ⋮ Non-separating induced cycles in graphs ⋮ Counting critical subgraphs in \(k\)-critical graphs ⋮ Extremal graphs without a semi-topological wheel

Cites Work

• Unnamed Item
• Unnamed Item
• A minimal condition implying a special K\(_4\)-subdivision in a graph
• Non-separating induced cycles in graphs
• Hajos' graph-coloring conjecture: Variations and counterexamples
• Semi-topological subgraphs
• Homomorphism theorems for graphs
• 4‐chrome Graphen und vollständige 4‐Graphen
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: Special subdivisions of \(K_4\) and 4-chromatic graphs