Colouring Planar Graphs With Three Colours and No Large Monochromatic Components (Q5495675): Difference between revisions

@@ Property / cites work @@
+Lower bound of the Hadwiger number of graphs by their average degree
+Normal rank
@@ Property / cites work @@
+From the plane to higher surfaces
@@ Property / cites work: From the plane to higher surfaces / rank @@
+Normal rank
@@ Property / cites work @@
+A relaxed Hadwiger's conjecture for list colorings
+Normal rank
@@ Property / cites work @@
+Bounded size components -- partitions and transversals.
+Normal rank
@@ Property / cites work @@
+Low diameter graph decompositions
@@ Property / cites work: Low diameter graph decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning into graphs with only small components
+Normal rank
@@ Property / cites work @@
+Contractibility and the Hadwiger conjecture
@@ Property / cites work: Contractibility and the Hadwiger conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+An extremal function for contractions of graphs
@@ Property / cites work: An extremal function for contractions of graphs / rank @@
+Normal rank