Chvátal’s t 0-Tough Conjecture (Q5506780): 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.1007/978-3-319-31940-7_9
+Normal rank
@@ Property / OpenAlex ID @@
+W2535038151
@@ Property / OpenAlex ID: W2535038151 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3781786
@@ Property / cites work: Q3781786 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing tough graphs is NP-hard
@@ Property / cites work: Recognizing tough graphs is NP-hard / rank @@
+Normal rank
@@ 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 @@
+Toughness in graphs -- a survey
@@ Property / cites work: Toughness in graphs -- a survey / rank @@
+Normal rank
@@ Property / cites work @@
+More than one tough chordal planar graphs are Hamiltonian
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and Hamiltonicity in \(k\)-trees
@@ Property / cites work: Toughness and Hamiltonicity in \(k\)-trees / rank @@
+Normal rank
@@ Property / cites work @@
+On Toughness and Hamiltonicity of 2<i>K</i><sub>2</sub>‐Free Graphs
+Normal rank
@@ Property / cites work @@
+Q4378526
@@ Property / cites work: Q4378526 / 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 @@
+-tough cocomparability graphs are hamiltonian
@@ Property / cites work: 1-tough cocomparability graphs are hamiltonian / rank @@
+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 @@
+The square of every two-connected graph is Hamiltonian
+Normal rank
@@ Property / cites work @@
+Tough spiders
@@ Property / cites work: Tough spiders / rank @@
+Normal rank
@@ Property / cites work @@
+Hamilton cycles in 5-connected line graphs
@@ Property / cites work: Hamilton cycles in 5-connected line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Hamiltonian circuits in interval graphs
@@ Property / cites work: Finding Hamiltonian circuits in interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness, hamiltonicity and split graphs
@@ Property / cites work: Toughness, hamiltonicity and split graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian results inK1,3-free graphs
@@ Property / cites work: Hamiltonian results inK1,3-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On a closure concept in claw-free graphs
@@ Property / cites work: On a closure concept in claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Reflections on graph theory
@@ Property / cites work: Reflections on graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem on Planar Graphs
@@ Property / cites work: A Theorem on Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On hamiltonian line graphs and connectivity
@@ Property / cites work: On hamiltonian line graphs and connectivity / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5506780