An approximate version of Hadwiger's conjecture for claw-free graphs (Q3553232): Difference between revisions

@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+A special case of Hadwiger's conjecture
@@ Property / cites work: A special case of Hadwiger's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Hadwiger's conjecture for quasi-line graphs
@@ Property / cites work: Hadwiger's conjecture for quasi-line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Claw-free graphs. I: Orientable prismatic graphs
@@ Property / cites work: Claw-free graphs. I: Orientable prismatic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Claw-free graphs. V. Global structure
@@ Property / cites work: Claw-free graphs. V. Global structure / rank @@
+Normal rank
@@ Property / cites work @@
+Packing seagulls
@@ Property / cites work: Packing seagulls / rank @@
+Normal rank
@@ Property / cites work @@
+Q5837979
@@ Property / cites work: Q5837979 / rank @@
+Normal rank
@@ Property / cites work @@
+Hadwiger's conjecture for line graphs
@@ Property / cites work: Hadwiger's conjecture for line graphs / rank @@
+Normal rank