An approximate version of Hadwiger's conjecture for claw-free graphs (Q3553232): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1002/jgt.20425 / 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: A special case of Hadwiger's conjecture / 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: Claw-free graphs. I: Orientable prismatic graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Claw-free graphs. V. Global structure / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing seagulls / 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 | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q122979949 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1002/JGT.20425 / rank | |||
Normal rank |
Latest revision as of 11:39, 21 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An approximate version of Hadwiger's conjecture for claw-free graphs |
scientific article |
Statements
An approximate version of Hadwiger's conjecture for claw-free graphs (English)
0 references
22 April 2010
0 references
claw-free graphs
0 references
Hadwiger's conjecture
0 references
coloring
0 references
clique minors
0 references