Decomposition of Bipartite Graphs Into Paths

DOI10.2307/2323307zbMath0661.05039OpenAlexW2319303323MaRDI QIDQ3809823

Kiran B. Chilakamarri

Publication date: 1988

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2323307

zbMATH Keywords

pathsdecompositionbipartite graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

On ascending subgraph decomposition of graphs ⋮ On the use of augmenting chains in chain packings ⋮ Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs

This page was built for publication: Decomposition of Bipartite Graphs Into Paths