Disjoint A-paths in digraphs

DOI10.1016/J.JCTB.2005.03.001MaRDI QIDQ2565693zbMATH OpenOpenAlexFDO

Authors Matthias Kriesell

Publication date 28 September 2005

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jctb.2005.03.001

zbMATH Keywords

path matchingGallai condition

Mathematics Subject Classification ID

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

Recommendations

• Disjoint paths in acyclic digraphs
• Disjoint paths in decomposable digraphs
• scientific article; zbMATH DE number 4089593
• Disjoint paths in graphs. (Reprint)
• Disjoint paths in symmetric digraphs
• Disjoint paths in graphs
• Disjoint directed and undirected paths and cycles in digraphs
• Disjoint paths in graphs. II: A special case
• Disjoint paths in graphs. III: Characterization
• Disjoint paths in sparse graphs

Cites work

• scientific article; zbMATH DE number 3141016 (Why is no real title available?)
• scientific article; zbMATH DE number 4089593 (Why is no real title available?)
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• A short proof of Mader's \(\mathcal S\)-paths theorem
• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
• The Factorization of Linear Graphs
• Über die Maximalzahl kreuzungsfreier H-Wege
• Über ein graphentheoretisches Ergebnis von T. Gallai
• Über ein graphentheoretisches Problem von T. Gallai

Cited in

(14)

• Packing non-zero \(A\)-paths in an undirected model of group labeled graphs
• Vertex-disjoint paths and edge-disjoint branchings in directed graphs
• Disjoint sub(di)graphs in digraphs
• An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
• Disjoint paths in graphs. III: Characterization
• Disjoint non-balanced \(A\)-paths in biased graphs
• Disjoint paths in symmetric digraphs
• Packing \(A\)-paths of length zero modulo four
• Disjoint directed and undirected paths and cycles in digraphs
• Path-closed sets
• Packing cycles with modularity constraints
• Frames, \(A\)-paths, and the Erdős-Pósa property
• Disjoint path covers joining prescribed source and sink sets in interval graphs
• Arc-disjoint paths in decomposable digraphs

This page was built for publication: Disjoint \(A\)-paths in digraphs

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