Berge's conjecture on directed path partitions -- a survey
From MaRDI portal
Publication:2433711
DOI10.1016/j.disc.2005.12.039zbMath1102.05046OpenAlexW2078268532WikidataQ123254297 ScholiaQ123254297MaRDI QIDQ2433711
Publication date: 30 October 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.039
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items
\( \chi \)-diperfect digraphs, Ramsey-type results for path covers and path partitions. II: Digraphs, Proof of Berge's strong path partition conjecture for \(k=2\), On the strong and the semi-strong path partition conjecture, On Linial's conjecture for spine digraphs, A unified approach to known and unknown cases of Berge's conjecture, On the duality of semiantichains and unichain coverings., On Path Partitions and Colourings in Digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the strong path partition conjecture of Berge
- On Greene-Kleitman's theorem for general digraphs
- The strong perfect graph theorem
- Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture
- Path partitions and packs of acyclic digraphs
- A Chvátal-Erdős condition for (1,1)-factors in digraphs
- On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
- A Chvátal-Erdős condition for Hamilton cycles in digraphs
- Variations on the Gallai-Milgram theorem
- A short proof of the existence of k-saturated partitions of partially ordered sets
- On chain and antichain families of a partially ordered set
- Extending the Greene-Kleitman theorem to directed graphs
- On matroid intersections
- k-optimal partitions of a directed graph
- Coflow polyhedra
- On the Berge's strong path partition conjecture
- Some partitions associated with a partially ordered set
- On partitions of a partially ordered set
- Covering digraphs by paths
- Every finite strongly connected digraph of stability 2 has a Hamiltonian path
- Extending Greene's theorem to directed graphs
- Diperfect graphs
- Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture
- A short proof of the Chen-Manalastas theorem
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
- Proof of Berge's strong path partition conjecture for \(k=2\)
- A note on Hamiltonian circuits
- A decomposition theorem for partially ordered sets
- Diconnected Orientations and a Conjecture of Las Vergnas
- On greene's theorem for digraphs
- The structure of Sperner k-families
