Building a maximal independent set for the vertex-coloring problem on planar graphs (Q2133444): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.entcs.2020.10.007
+Normal rank
@@ Property / OpenAlex ID @@
+W3110101364
@@ Property / OpenAlex ID: W3110101364 / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for planar graphs to be 3-colorable
+Normal rank
@@ Property / cites work @@
+Planar graphs without cycles of length from 4 to 7 are 3-colorable
+Normal rank
@@ Property / cites work @@
+Q4633818
@@ Property / cites work: Q4633818 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: an ongoing guide
@@ Property / cites work: The NP-completeness column: an ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs
+Normal rank
@@ Property / cites work @@
+Planar graphs: Theory and algorithms
@@ Property / cites work: Planar graphs: Theory and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The four-colour theorem
@@ Property / cites work: The four-colour theorem / rank @@
+Normal rank
@@ Property / cites work @@
+-Colouring AT-Free Graphs in Polynomial Time
@@ Property / cites work: 3-Colouring AT-Free Graphs in Polynomial Time / rank @@
+Normal rank