Skip to main content
Journal Article

The path-packing structure of graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3064 256-270
DOI: 10.1007/978-3-540-25960-2_20
9Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We prove Edmonds-Gallai type structure theorems for Mader's edge- and vertex-disjoint paths including also capacitated variants, and state a conjecture generalizing Mader's minimax theorems on path packings and Cunningham and Geelen's path-matching theorem. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Sebo, A., & Szego, L. (2004). The path-packing structure of graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3064, 256–270. https://doi.org/10.1007/978-3-540-25960-2_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free