Every signed planar graph without cycles of length from 4 to 8 is 3-colorable (Q1686009): 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.disc.2017.09.019
+Normal rank
@@ Property / OpenAlex ID @@
+W2761787226
@@ Property / OpenAlex ID: W2761787226 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4000782
@@ Property / cites work: Q4000782 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / 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 @@
+Steinberg's conjecture is false
@@ Property / cites work: Steinberg's conjecture is false / rank @@
+Normal rank
@@ Property / cites work @@
+Choosability in signed planar graphs
@@ Property / cites work: Choosability in signed planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic number of a signed graph
@@ Property / cites work: The chromatic number of a signed graph / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the three color problem
@@ Property / cites work: A note on the three color problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139765
@@ Property / cites work: Q3139765 / rank @@
+Normal rank
@@ Property / cites work @@
+Signed graph coloring
@@ Property / cites work: Signed graph coloring / rank @@
+Normal rank