On the use of augmenting chains in chain packings

DOI10.1016/0166-218X(91)90039-YzbMath0763.05086OpenAlexW1982149770MaRDI QIDQ1174179

Dominique de Werra, Fred S. Roberts

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0166-218x(91)90039-y

zbMATH Keywords

matchingtreesshort chainsaugmenting chainchain packingedge-disjoint chainsmatching matroids

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Ejection chains, reference structures and alternating path methods for traveling salesman problems

Cites Work

• Odd path packings
• Variation on a theorem of König
• Packings by cliques and by finite families of graphs
• On certain polytopes associated with graphs
• Generalized edge packings
• Packings by Complete Bipartite Graphs
• Decomposition of Bipartite Graphs Into Paths
• Augmenting Paths and a Class of Independence Systems
• Partitions into odd chains
• The Factors of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item