Pages that link to "Item:Q1694726"
From MaRDI portal
The following pages link to One-to-one disjoint path covers in digraphs (Q1694726):
Displaying 8 items.
- One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes (Q638511) (← links)
- Ore-type degree conditions for disjoint path covers in simple graphs (Q898138) (← 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)
- Computing and Combinatorics (Q4681201) (← 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)
- One-to-one disjoint-path covers of leaf-sort graphs (Q6656781) (← links)