Pages that link to "Item:Q2864296"

The following pages link to Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs (Q2864296):

Displaying 8 items.

• The total interval number of a tree and the Hamiltonian completion number of its line graph (Q672831) (← links)
• The neighbour-scattering number can be computed in polynomial time for interval graphs (Q1005803) (← links)
• Scattering number and extremal non-Hamiltonian graphs (Q1109047) (← links)
• Computing the weighted isolated scattering number of interval graphs in polynomial time (Q2325144) (← links)
• A polynomial algorithm for weighted scattering number in interval graphs (Q2422741) (← links)
• Spanning connectedness and Hamiltonian thickness of graphs and interval graphs (Q2827796) (← links)
• Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
• Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time (Q6087804) (← links)