Three colorability characterized by shrinking of locally connected subgraphs into triangles (Q1708265): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2018.02.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2793655049
@@ Property / OpenAlex ID: W2793655049 / rank @@
+Normal rank
@@ Property / cites work @@
+-coloring in time
@@ Property / cites work: 3-coloring in time / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414492
@@ Property / cites work: Q4414492 / rank @@
+Normal rank
@@ Property / cites work @@
+Colorability of planar graphs with isolated nontriangular faces
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+-coloring and 3-clique-ordering of locally connected graphs
+Normal rank
@@ Property / cites work @@
+The 3-Colorability Problem on Graphs with Maximum Degree Four
+Normal rank
@@ Property / cites work @@
+On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Q4882469
@@ Property / cites work: Q4882469 / rank @@
+Normal rank