Path Partitions in Directed Graphs

DOI10.1016/S0304-0208(08)73373-5zbMATH Open0523.05040OpenAlexW1199371048MaRDI QIDQ3674702FDOQ3674702

Authors: C. Berge 

Publication date: 1983

Published in: Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73373-5

zbMATH Keywords

independent nodesarborescence forestcovering strongly connected graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Cited In (14)

• On the strong path partition conjecture of Berge
• Capacities of graphs and \(2\)-matchings
• A short proof of the Chen-Manalastas theorem
• BE-diperfect digraphs with stability number two
• Near-homogeneous tournaments and permutation groups
• On the Berge's strong path partition conjecture
• Theory of 2-structures. II: Representation through labeled tree families
• Motivations and history of some of my conjectures
• Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture
• Collapsing and lifting for the cut cone
• Parameterizing path partitions
• Convexity in Graphs and Hypergraphs
• Local optima topology for the \(k\)-coloring problem
• Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture

This page was built for publication: Path Partitions in Directed Graphs

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