On the strong path partition conjecture of Berge

DOI10.1016/0012-365X(93)90341-PzbMATH Open0783.05067OpenAlexW2026120709WikidataQ122927872 ScholiaQ122927872MaRDI QIDQ686176FDOQ686176

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

Recommendations

• On the Berge's strong path partition conjecture
• Paths and stability number in digraphs
• Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\)
• Proof of Berge's strong path partition conjecture for \(k=2\)
• Berge's conjecture on directed path partitions -- a survey

zbMATH Keywords

cyclesdirected graphpath partitionlongest path

Mathematics Subject Classification ID

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

Cites Work

• Extending the Greene-Kleitman theorem to directed graphs
• k-optimal partitions of a directed graph
• Title not available (Why is that?)
• Nombre chromatique et plus longs chemins d'un graphe
• Title not available (Why is that?)
• Covering digraphs by paths
• On the Berge's strong path partition conjecture
• Path Partitions in Directed Graphs

Cited In (7)

• On the strong and the semi-strong path partition conjecture
• On the Berge's strong path partition conjecture
• Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs
• About colorings, stability and paths in directed graphs
• Berge's conjecture on directed path partitions -- a survey
• Proof of Berge's strong path partition conjecture for \(k=2\)
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686176)