On the complexity of deciding whether the regular number is at most two (Q497328): Difference between revisions

@@ Property / DOI @@
-.1007/s00373-014-1446-9
@@ Property / DOI: 10.1007/s00373-014-1446-9 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W3101915495
@@ Property / OpenAlex ID: W3101915495 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1182
@@ Property / arXiv ID: 1403.1182 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial cases of graph decomposition: A complete solution of Holyer's problem
+Normal rank
@@ Property / cites work @@
+Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
+Normal rank
@@ Property / cites work @@
+The regular number of a graph
@@ Property / cites work: The regular number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Some Edge-Partition Problems
+Normal rank
@@ Property / cites work @@
+Complexity of approximation of 3-edge-coloring of graphs
+Normal rank
@@ Property / cites work @@
+Regular number of a graph
@@ Property / cites work: Regular number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+NP completeness of finding the chromatic index of regular graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of some edge-partition problems for graphs
+Normal rank
@@ Property / cites work @@
+Complexité de l'arboricité linéaire d'un graphe
+Normal rank
@@ Property / cites work @@
+Graph factors and factorization: 1985--2003: a survey
+Normal rank
@@ Property / cites work @@
+Q4869540
@@ Property / cites work: Q4869540 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00373-014-1446-9
@@ Property / DOI: 10.1007/S00373-014-1446-9 / rank @@
+Normal rank