10-tough chordal graphs are Hamiltonian (extended abstract) (Q322253): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2015.06.045
+Normal rank
@@ Property / OpenAlex ID @@
+W2221338866
@@ Property / OpenAlex ID: W2221338866 / rank @@
+Normal rank
@@ Property / cites work @@
+Hall's theorem for hypergraphs
@@ Property / cites work: Hall's theorem for hypergraphs / 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 @@
+Not every 2-tough graph is Hamiltonian
@@ Property / cites work: Not every 2-tough graph is Hamiltonian / rank @@
+Normal rank
@@ Property / cites work @@
+More than one tough chordal planar graphs are Hamiltonian
+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 @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+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