On the strong path partition conjecture of Berge

DOI10.1016/0012-365X(93)90341-PzbMath0783.05067OpenAlexW2026120709WikidataQ122927872 ScholiaQ122927872MaRDI QIDQ686176

Juan-Miguel Gracia

Publication date: 1 November 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90341-p

zbMATH Keywords

cyclesdirected graphlongest pathpath partition

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items

Berge's conjecture on directed path partitions -- a survey ⋮ Proof of Berge's strong path partition conjecture for \(k=2\) ⋮ On the strong and the semi-strong path partition conjecture ⋮ Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Extending the Greene-Kleitman theorem to directed graphs
• k-optimal partitions of a directed graph
• On the Berge's strong path partition conjecture
• Covering digraphs by paths
• Path Partitions in Directed Graphs
• Nombre chromatique et plus longs chemins d'un graphe

This page was built for publication: On the strong path partition conjecture of Berge