Computation of the 0-dual closure for hamiltonian graphs (Q686512): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Semi-independence number of a graph and the existence of Hamiltonian circuits
+Normal rank
@@ Property / cites work @@
+A generalization of a result of Häggkvist and Nicoghossian
+Normal rank
@@ Property / cites work @@
+A method in graph theory
@@ Property / cites work: A method in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3781785
@@ Property / cites work: Q3781785 / rank @@
+Normal rank
@@ Property / cites work @@
+On Hamilton's ideals
@@ Property / cites work: On Hamilton's ideals / rank @@
+Normal rank
@@ Property / cites work @@
+More powerful closure operations on graphs
@@ Property / cites work: More powerful closure operations on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Note on Hamilton circuits and Hamilton paths
@@ Property / cites work: Note on Hamilton circuits and Hamilton paths / rank @@
+Normal rank
@@ Property / cites work @@
+Neighbourhood unions and Hamiltonian properties in graphs
+Normal rank
@@ Property / cites work @@
+Q3699724
@@ Property / cites work: Q3699724 / rank @@
+Normal rank
@@ Property / cites work @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Q3995378
@@ Property / cites work: Q3995378 / rank @@
+Normal rank