Pages that link to "Item:Q1066674"

The following pages link to Finding Hamiltonian circuits in interval graphs (Q1066674):

Displaying 50 items.

• 10-tough chordal graphs are Hamiltonian (extended abstract) (Q322253) (← links)
• 10-tough chordal graphs are Hamiltonian (Q345090) (← links)
• Subgraph isomorphism in graph classes (Q456655) (← links)
• The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
• Hamiltonian properties of locally connected graphs with bounded vertex degree (Q643015) (← links)
• Some properties of \(k\)-trees (Q708399) (← links)
• Efficient reduction for path problems on circular-arc graphs (Q802884) (← links)
• Cyclability in graph classes (Q833007) (← links)
• Toughness and Hamiltonicity in \(k\)-trees (Q868350) (← links)
• Linear algorithm for optimal path cover problem on interval graphs (Q911770) (← links)
• An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals (Q915465) (← links)
• New sequential and parallel algorithms for interval graph recognition (Q922725) (← links)
• Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
• Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs (Q960979) (← links)
• A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586) (← links)
• A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
• Finding the minimum bandwidth of an interval graph (Q1090458) (← links)
• Hamiltonian circuits in interval graph generalizations (Q1092669) (← links)
• On the domatic number of interval graphs (Q1111388) (← links)
• On finding the minimum bandwidth of interval graphs (Q1183610) (← links)
• Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484) (← links)
• Generalized vertex covering in interval graphs (Q1199467) (← links)
• Hamiltonian cycle is polynomial on cocomparability graphs (Q1201106) (← links)
• Paths in interval graphs and circular arc graphs (Q1210553) (← links)
• Linear algorithm for domatic number problem on interval graphs (Q1262139) (← links)
• 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
• Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
• Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
• Achromatic number is NP-complete for cographs and interval graphs (Q1825646) (← links)
• Toughness, hamiltonicity and split graphs (Q1916113) (← links)
• HAMILTONian circuits in chordal bipartite graphs (Q1923528) (← links)
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
• \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited (Q2067672) (← links)
• The Steiner cycle and path cover problem on interval graphs (Q2075469) (← links)
• A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
• Mim-width. I. Induced path problems (Q2174563) (← links)
• The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy (Q2181262) (← links)
• The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
• A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
• Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
• Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
• Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873) (← links)
• The harmonious coloring problem is NP-complete for interval and permutation graphs (Q2457020) (← links)
• Toughness in graphs -- a survey (Q2494126) (← links)
• A note on longest paths in circular arc graphs (Q2516667) (← links)
• Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs (Q2675828) (← links)
• Complexity of Steiner Tree in Split Graphs - Dichotomy Results (Q2795958) (← links)
• Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time (Q2840712) (← links)
• A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472) (← links)
• Hamiltonicity in Split Graphs - A Dichotomy (Q2971662) (← links)