A note on \(K_ 4\)-closures in hamiltonian graph theory (Q1309444): Difference between revisions

@@ Property / author @@
+Hajo J. Broersma
@@ Property / author: Hajo J. Broersma / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
+Normal rank
@@ Property / cites work @@
+Semi-independence number of a graph and the existence of Hamiltonian circuits
+Normal rank
@@ Property / cites work @@
+A method in graph theory
@@ Property / cites work: A method in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3474676
@@ Property / cites work: Q3474676 / rank @@
+Normal rank
@@ Property / cites work @@
+Some localization theorems on Hamiltonian circuits
+Normal rank
@@ Property / cites work @@
+Computation of the 0-dual closure for hamiltonian graphs
+Normal rank
@@ Property / cites work @@
+Q3807250
@@ Property / cites work: Q3807250 / rank @@
+Normal rank
@@ Property / cites work @@
+A generalization of the Bondy-Chvátal theorem on the k-closure
+Normal rank
@@ Property / cites work @@
+More powerful closure operations on graphs
@@ Property / cites work: More powerful closure operations on graphs / rank @@
+Normal rank