Pages that link to "Item:Q5265335"

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

Displayed 10 items.

• Cyclability in graph classes (Q833007) ‎ (← links)
• Long paths and toughness of \(k\)-trees and chordal planar graphs (Q1618219) ‎ (← links)
• The scattering number of strictly chordal graphs: linear time determination (Q2144221) ‎ (← links)
• Characterization of interval graphs that are unpaired 2-disjoint path coverable (Q2173303) ‎ (← links)
• Computing the weighted isolated scattering number of interval graphs in polynomial time (Q2325144) ‎ (← links)
• Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) ‎ (← links)
• A polynomial algorithm for weighted scattering number in interval graphs (Q2422741) ‎ (← links)
• A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472) ‎ (← links)
• The vertex attack tolerance of complex networks (Q4578160) ‎ (← links)
• Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) ‎ (← links)