Pages that link to "Item:Q2827796"

The following pages link to Spanning connectedness and Hamiltonian thickness of graphs and interval graphs (Q2827796):

Displaying 13 items.

• A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
• Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q2111523) (← links)
• A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
• Characterization of interval graphs that are unpaired 2-disjoint path coverable (Q2173303) (← links)
• Torus-like graphs and their paired many-to-many disjoint path covers (Q2217462) (← links)
• The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
• Generalizations of the classics to spanning connectedness (Q2242808) (← links)
• Mathematical properties on the hyperbolicity of interval graphs (Q2333446) (← links)
• Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
• Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs (Q2864296) (← links)
• A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472) (← links)
• Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
• The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735) (← links)