On choosability with separation of planar graphs without adjacent short cycles (Q723623): Difference between revisions

@@ Property / cites work @@
+On Choosability with Separation of Planar Graphs with Forbidden Cycles
+Normal rank
@@ Property / cites work @@
+Choosability with Separation of Complete Multipartite Graphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+List colourings of planar graphs
@@ Property / cites work: List colourings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Brooks-type theorems for choosability with separation
+Normal rank
@@ Property / cites work @@
+Q4882549
@@ Property / cites work: Q4882549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2716011
@@ Property / cites work: Q2716011 / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar graph is 5-choosable
@@ Property / cites work: Every planar graph is 5-choosable / rank @@
+Normal rank
@@ Property / cites work @@
+A not 3-choosable planar graph without 3-cycles
@@ Property / cites work: A not 3-choosable planar graph without 3-cycles / rank @@
+Normal rank