Reducing Hajós' 4-coloring conjecture to 4-connected graphs (Q2496200): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: On the conjecture of Hajos / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Do 3n − 5 edges force a subdivision ofK5? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological minors in graphs of large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Topological Cliques in Graphs of Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(3n-5\) edges do force a subdivision of \(K_5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on Hajós' conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and Connectivity in Graphs / rank
 
Normal rank

Latest revision as of 17:02, 24 June 2024

scientific article
Language Label Description Also known as
English
Reducing Hajós' 4-coloring conjecture to 4-connected graphs
scientific article

    Statements

    Identifiers