1-tough cocomparability graphs are hamiltonian (Q1363656): Difference between revisions

@@ Property / cites work @@
+On the complexity of recognizing tough graphs
@@ Property / cites work: On the complexity of recognizing tough graphs / 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 @@
+Q4873795
@@ Property / cites work: Q4873795 / rank @@
+Normal rank
@@ Property / cites work @@
+Long cycles in graphs with large degree sums
@@ Property / cites work: Long cycles in graphs with large degree sums / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / 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 @@
+Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
+Normal rank
@@ Property / cites work @@
+Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
+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 @@
+Computing the bump number is easy
@@ Property / cites work: Computing the bump number is easy / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian degree conditions for tough graphs
@@ Property / cites work: Hamiltonian degree conditions for tough graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonicity in graphs with few \(P_ 4\)'s
@@ Property / cites work: Hamiltonicity in graphs with few \(P_ 4\)'s / rank @@
+Normal rank
@@ Property / cites work @@
+On Maximal Circuits in Finite Graphs
@@ Property / cites work: On Maximal Circuits in Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On a class of posets and the corresponding comparability 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
@@ Property / cites work @@
+An optimal path cover algorithm for cographs
@@ Property / cites work: An optimal path cover algorithm for cographs / rank @@
+Normal rank
@@ Property / cites work @@
+An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals
+Normal rank
@@ Property / cites work @@
+Computing the bump number with techniques from two-processor scheduling
+Normal rank
@@ Property / cites work @@
+An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs
+Normal rank