Covering a strong digraph by -1 disjoint paths: A proof of Las Vergnas' conjecture
From MaRDI portal
Publication:1850573
DOI10.1006/JCTB.2001.2055zbMATH Open1023.05115OpenAlexW1969592750MaRDI QIDQ1850573FDOQ1850573
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2001.2055
Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sur les arborescences dans un graphe oriente
- Every finite strongly connected digraph of stability 2 has a Hamiltonian path
- Path Partitions in Directed Graphs
- A short proof of the Chen-Manalastas theorem
Cited In (9)
- A short proof of the Chen-Manalastas theorem
- BE-diperfect digraphs with stability number two
- A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs
- Berge's conjecture on directed path partitions -- a survey
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs
- The complexity of finding arc-disjoint branching flows
- Structural properties of minimal strong digraphs versus trees
- Balanced branchings in digraphs
- Structural and spectral properties of minimal strong digraphs
This page was built for publication: Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850573)
