Pages that link to "Item:Q898138"
From MaRDI portal
The following pages link to Ore-type degree conditions for disjoint path covers in simple graphs (Q898138):
Displaying 9 items.
- One-to-one disjoint path covers in digraphs (Q1694726) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← 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)
- 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)
- Degree sequence conditions for a graph to be disjoint path coverable (Q2696615) (← links)
- A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs (Q6041530) (← links)
- Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults (Q6132395) (← links)