On the Berge's strong path partition conjecture

DOI10.1016/0012-365X(93)90245-OzbMath0783.05083WikidataQ123266822 ScholiaQ123266822MaRDI QIDQ1210577

S. Singh

Publication date: 30 August 1993

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

zbMATH Keywords

digraphstable setspath partitionpartial \(k\)-coloringstrong path partition conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38) 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

Motivations and history of some of my conjectures ⋮ Berge's conjecture on directed path partitions -- a survey ⋮ On the strong path partition conjecture of Berge

Cites Work

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