A parity theorem about trees with specified degrees (Q2235250): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2021.08.017
+Normal rank
@@ Property / OpenAlex ID @@
+W3197202779
@@ Property / OpenAlex ID: W3197202779 / rank @@
+Normal rank
@@ Property / cites work @@
+Parity results on connected f-factors
@@ Property / cites work: Parity results on connected f-factors / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Thomason's algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs
+Normal rank
@@ Property / cites work @@
+Some graphic uses of an even number of odd nodes
@@ Property / cites work: Some graphic uses of an even number of odd nodes / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles containing all the odd-degree vertices
@@ Property / cites work: Cycles containing all the odd-degree vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Simple algorithm for finding a second Hamilton cycle
+Normal rank
@@ Property / cites work @@
+The complexity of finding a second Hamiltonian cycle in cubic graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of the parity argument and other inefficient proofs of existence
+Normal rank
@@ Property / cites work @@
+Hamiltonian Cycles and Uniquely Edge Colourable Graphs
+Normal rank
@@ Property / cites work @@
+Chords in longest cycles
@@ Property / cites work: Chords in longest cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of a Euler graph
@@ Property / cites work: Properties of a Euler graph / rank @@
+Normal rank
@@ Property / cites work @@
+On Hamiltonian Circuits
@@ Property / cites work: On Hamiltonian Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Q5110817
@@ Property / cites work: Q5110817 / rank @@
+Normal rank
@@ Property / cites work @@
+THE COMPLEXITY OF THOMASON’S ALGORITHM FOR FINDING A SECOND HAMILTONIAN CYCLE
+Normal rank