Pages that link to "Item:Q1363667"

The following pages link to Proper interval graphs and the guard problem (Q1363667):

Displaying 9 items.

• Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
• Backup 2-center on interval graphs (Q442280) (← links)
• Canonical antichains of unit interval and bipartite permutation graphs (Q651422) (← links)
• Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
• A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586) (← links)
• Hamiltonian paths, unit-interval complexes, and determinantal facet ideals (Q2168562) (← links)
• Characterization of interval graphs that are unpaired 2-disjoint path coverable (Q2173303) (← links)
• Complexity of Hamiltonian cycle reconfiguration (Q2633261) (← links)
• Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)