Toughness and prism-Hamiltonicity of \(P_4\)-free graphs (Q777381): Difference between revisions

@@ Property / cites work @@
+Not every 2-tough graph is Hamiltonian
@@ Property / cites work: Not every 2-tough graph is Hamiltonian / rank @@
+Normal rank
@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Chvátal-Erdős condition for prism-Hamiltonicity
+Normal rank
@@ Property / cites work @@
+Toughness and the existence ofk-factors
@@ Property / cites work: Toughness and the existence ofk-factors / rank @@
+Normal rank
@@ Property / cites work @@
+On the Toughness of a Graph
@@ Property / cites work: On the Toughness of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4014627
@@ Property / cites work: Q4014627 / rank @@
+Normal rank
@@ Property / cites work @@
+On a class of posets and the corresponding comparability graphs
+Normal rank
@@ Property / cites work @@
+Hamilton cycles in prisms
@@ Property / cites work: Hamilton cycles in prisms / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of Hamiltonian prisms
@@ Property / cites work: A characterization of Hamiltonian prisms / rank @@
+Normal rank
@@ Property / cites work @@
+On a connection between the existence of k-trees and the toughness of a graph
+Normal rank