Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs (Q2891038): Difference between revisions

@@ Property / cites work @@
+The edge Hamiltonian path problem is NP-complete
@@ Property / cites work: The edge Hamiltonian path problem is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
+Normal rank
@@ Property / cites work @@
+A note about the dominating circuit conjecture
@@ Property / cites work: A note about the dominating circuit conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+On some conjectures on cubic 3-connected graphs
@@ Property / cites work: On some conjectures on cubic 3-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On Eulerian and Hamiltonian Graphs and Line Graphs
+Normal rank
@@ Property / cites work @@
+Equivalence of Fleischner's and Thomassen's conjectures
+Normal rank
@@ Property / cites work @@
+A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs
+Normal rank
@@ Property / cites work @@
+Eulerian subgraphs and Hamilton-connected line graphs
+Normal rank
@@ Property / cites work @@
+On a closure concept in claw-free graphs
@@ Property / cites work: On a closure concept in claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Reflections on graph theory
@@ Property / cites work: Reflections on graph theory / rank @@
+Normal rank