Hadwiger's conjecture for quasi-line graphs (Q3528157): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Claw-free graphs. III: Circular interval 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: Coloring quasi-line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture for line graphs / rank
 
Normal rank

Latest revision as of 18:03, 28 June 2024

scientific article
Language Label Description Also known as
English
Hadwiger's conjecture for quasi-line graphs
scientific article

    Statements

    Hadwiger's conjecture for quasi-line graphs (English)
    0 references
    0 references
    8 October 2008
    0 references
    0 references
    minors
    0 references
    Hadwiger's conjecture
    0 references
    claw-free graphs
    0 references
    quasi line graph
    0 references
    0 references
    0 references