Decomposition of Bipartite Graphs Into Paths

DOI10.2307/2323307MaRDI QIDQ3809823zbMATH OpenOpenAlexFDO

Authors 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

decompositionpathsbipartite graph

Mathematics Subject Classification ID

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

Recommendations

• Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
• Decomposition of complete bipartite graphs into paths and cycles
• Path decompositions of \(\lambda K_{n,n}\)
• scientific article; zbMATH DE number 812067
• Balanced path decomposition of \(\lambda K_{n,n}\) and \(\lambda K^*_{n,n}\)

Cited in

(7)

• Decomposition of complete bipartite graphs into open trails
• On ascending subgraph decomposition of graphs
• On the use of augmenting chains in chain packings
• Graph-Theoretic Concepts in Computer Science
• Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs
• scientific article; zbMATH DE number 812067 (Why is no real title available?)
• scientific article; zbMATH DE number 5917766 (Why is no real title available?)

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

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