Pages that link to "Item:Q1050117"

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

Displaying 35 items.

• Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← 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)
• 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)
• Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
• A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs (Q989571) (← 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 Hamiltonian circuits in interval graphs (Q1066674) (← links)
• Hamiltonian circuits in interval graph generalizations (Q1092669) (← links)
• Some parallel algorithms on interval graphs (Q1098312) (← links)
• On the domatic number of interval graphs (Q1111388) (← links)
• Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
• Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
• Paths in interval graphs and circular arc graphs (Q1210553) (← links)
• Proper interval graphs and the guard problem (Q1363667) (← links)
• HAMILTONian circuits in chordal bipartite graphs (Q1923528) (← links)
• The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
• Hamiltonian paths, unit-interval complexes, and determinantal facet ideals (Q2168562) (← links)
• A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
• Mathematical properties on the hyperbolicity of interval graphs (Q2333446) (← links)
• Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
• Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873) (← links)
• The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610) (← links)
• ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608) (← links)
• The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942) (← links)
• Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
• (Q4691817) (← links)
• Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
• Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
• Tropical paths in vertex-colored graphs (Q5918388) (← links)
• Intersection graphs of non-crossing paths (Q6041577) (← links)
• Path eccentricity of graphs (Q6162021) (← links)
• Frobenius methods in combinatorics (Q6171845) (← links)