The complexity of finding a second Hamiltonian cycle in cubic graphs (Q1307702): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1006/jcss.1998.1611
+Normal rank
@@ Property / OpenAlex ID @@
+W2066230947
@@ Property / OpenAlex ID: W2066230947 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234077
@@ Property / cites work: Q4234077 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4027186
@@ Property / cites work: Q4027186 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the parity argument and other inefficient proofs of existence
+Normal rank
@@ Property / cites work @@
+On existence theorems
@@ Property / cites work: On existence theorems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3959443
@@ Property / cites work: Q3959443 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian Cycles and Uniquely Edge Colourable Graphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1307702