Decompositions of regular bipartite graphs
From MaRDI portal
Publication:1176735
DOI10.1016/0012-365X(91)90396-JzbMath0754.05057OpenAlexW2044825574MaRDI QIDQ1176735
Miroslaw Truszczynski, Michael S. Jacobson, Zsolt Tuza
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(91)90396-j
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (14)
Decomposing 8-regular graphs into paths of length 4 ⋮ On double-star decomposition of graphs ⋮ Path decompositions of regular graphs with prescribed girth ⋮ Decomposing 10-regular graphs into paths of length 5 ⋮ Decompositions of 6-regular bipartite graphs into paths of length six ⋮ Decomposing regular graphs with prescribed girth into paths of given length ⋮ Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\) ⋮ Multidecompositions of the balanced complete bipartite graph into paths and stars ⋮ Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each ⋮ Regular path decompositions of odd regular graphs ⋮ Unnamed Item ⋮ General properties of some families of graphs defined by systems of equations ⋮ On decomposing regular graphs into isomorphic double-stars ⋮ Decompositions of triangle-free 5-regular graphs into paths of length five
Cites Work
This page was built for publication: Decompositions of regular bipartite graphs