Path Partitions in Directed Graphs

DOI10.1016/S0304-0208(08)73373-5zbMath0523.05040OpenAlexW1199371048MaRDI QIDQ3674702

Claude 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

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

Related Items

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