Hadwiger's Conjecture for Graphs with Forbidden Holes (Q5348213): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On triangles in ‐minor free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Lovász tihany conjecture for quasi-line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring quasi-line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture for quasi-line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate version of Hadwiger's conjecture for claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. VII. Quasi-line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / 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: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Certain Homomorphism Properties of Graphs I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a certain homomorphism properties of graphs II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the odd Hadwiger's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a special case of Hadwiger's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture for line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The four-colour theorem / 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: Clique minors in double‐critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs with forbidden minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger’s Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390609 / rank
 
Normal rank

Revision as of 05:51, 14 July 2024

scientific article; zbMATH DE number 6760179
Language Label Description Also known as
English
Hadwiger's Conjecture for Graphs with Forbidden Holes
scientific article; zbMATH DE number 6760179

    Statements

    Hadwiger's Conjecture for Graphs with Forbidden Holes (English)
    0 references
    14 August 2017
    0 references
    Hadwiger's conjecture
    0 references
    graph minor
    0 references
    quasi-line graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references