Pages that link to "Item:Q1957649"

The following pages link to The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649):

Displaying 23 items.

• Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
• Paired many-to-many disjoint path covers in restricted hypercube-like graphs (Q284574) (← links)
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs (Q497240) (← links)
• The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
• Ore-type degree conditions for disjoint path covers in simple graphs (Q898138) (← links)
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs (Q905847) (← links)
• A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (Q1628689) (← links)
• One-to-one disjoint path covers in digraphs (Q1694726) (← links)
• Flow shop scheduling problem with conflict graphs (Q1708533) (← links)
• The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
• The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks (Q2118871) (← 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)
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724) (← links)
• Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
• Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs (Q2441778) (← links)
• Single-source three-disjoint path covers in cubes of connected graphs (Q2444763) (← links)
• A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472) (← links)
• The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610) (← links)
• Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
• Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest (Q6114850) (← links)
• Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults (Q6132395) (← links)