One-to-one disjoint path covers in digraphs
From MaRDI portal
Publication:1694726
DOI10.1016/j.tcs.2017.12.006zbMath1387.05192OpenAlexW2772936786MaRDI QIDQ1694726
Zhiheng Zhou, Huabin Cao, Bicheng Zhang
Publication date: 6 February 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.12.006
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)
Related Items (4)
Characterization of interval graphs that are unpaired 2-disjoint path coverable ⋮ A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs ⋮ Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults ⋮ Torus-like graphs and their paired many-to-many disjoint path covers
Cites Work
- Unnamed Item
- Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
- Paired many-to-many disjoint path covers in faulty hypercubes
- One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
- Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements
- Ore-type degree conditions for disjoint path covers in simple graphs
- \(k\)-Ordered Hamilton cycles in digraphs
- Hamiltonian paths in oriented graphs
- A short proof of Meyniel's theorem
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
- Single-source three-disjoint path covers in cubes of connected graphs
- Paired many-to-many disjoint path covers of the hypercubes
- Disjoint path covers in cubes of connected graphs
- On spanning connected graphs
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
- On Path Cover Problems in Digraphs and Applications to Program Testing
- Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
- Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$
- Degree Conditions for H-Linked Digraphs
- Some Theorems on Abstract Graphs
This page was built for publication: One-to-one disjoint path covers in digraphs
