A note on the not 3-choosability of some families of planar graphs (Q845679): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2005.10.014
+Normal rank
@@ Property / OpenAlex ID @@
+W2159607383
@@ Property / OpenAlex ID: W2159607383 / rank @@
+Normal rank
@@ Property / cites work @@
+Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
+Normal rank
@@ Property / cites work @@
+Planar graphs without cycles of length from 4 to 7 are 3-colorable
+Normal rank
@@ Property / cites work @@
+Smaller planar triangle-free graphs that are not 3-list-colorable
+Normal rank
@@ Property / cites work @@
+pretty graph colouring problems
@@ Property / cites work: 25 pretty graph colouring problems / rank @@
+Normal rank
@@ Property / cites work @@
+-list-coloring planar graphs of girth 5
@@ Property / cites work: 3-list-coloring planar graphs of girth 5 / 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
@@ Property / cites work @@
+A non-3-choosable planar graph without cycles of length 4 and 5
+Normal rank
@@ Property / cites work @@
+A note on 3-choosability of planar graphs without certain cycles
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:845679