Pages that link to "Item:Q1092669"

The following pages link to Hamiltonian circuits in interval graph generalizations (Q1092669):

Displaying 34 items.

• Hamiltonian cycles in linear-convex supergrid graphs (Q335338) (← links)
• Subgraph isomorphism in graph classes (Q456655) (← links)
• The Hamiltonian properties of supergrid graphs (Q497690) (← links)
• An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
• An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
• A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
• Dominating sets in perfect graphs (Q1174132) (← links)
• Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484) (← links)
• Paths in interval graphs and circular arc graphs (Q1210553) (← links)
• A note on the Hamiltonian circuit problem on directed path graphs (Q1262132) (← links)
• The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← links)
• The Hamiltonian circuit problem for circle graphs is NP-complete (Q1823687) (← links)
• HAMILTONian circuits in chordal bipartite graphs (Q1923528) (← links)
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
• On the recognition of search trees generated by BFS and DFS (Q2087463) (← links)
• Revising Johnson's table for the 21st century (Q2091799) (← links)
• Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q2169982) (← links)
• The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy (Q2181262) (← links)
• Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
• A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
• Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
• Secure connected domination and secure total domination in unit disk graphs and rectangle graphs (Q2700783) (← links)
• Complexity of Steiner Tree in Split Graphs - Dichotomy Results (Q2795958) (← links)
• Hamiltonicity in Split Graphs - A Dichotomy (Q2971662) (← links)
• ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608) (← links)
• Deferred-query—An efficient approach for problems on interval and circular-arc graphs (Q5060115) (← links)
• Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
• Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy (Q6114853) (← links)
• Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)
• Edge deletion to tree-like graph classes (Q6124427) (← links)
• 2-Trees: Structural insights and the study of Hamiltonian paths (Q6132868) (← links)
• Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs (Q6136471) (← links)
• On 3-degree 4-chordal graphs (Q6174132) (← links)