Decomposition of complete bipartite graphs into paths and cycles

DOI10.1016/J.DISC.2014.05.009MaRDI QIDQ397156zbMATHzbMATHOpenAlexFDO

Authors S. Jeevadoss, A. Muthusamy

Publication date 8 August 2014

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2014.05.009

zbMATH Keywords

cyclegraph decompositionpathcomplete bipartite graph

Mathematics Subject Classification ID

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

Recommendations

• Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges
• Decomposition of complete bipartite graphs into paths and stars with same number of edges
• Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
• Decomposition of \(K_{m,n}\) into short cycles
• Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length

Cites work

• scientific article; zbMATH DE number 2186980 (Why is no real title available?)
• scientific article; zbMATH DE number 2192102 (Why is no real title available?)
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles
• Decomposition of \(K_{m,n}\) into short cycles
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Decomposition of complete bipartite graphs into paths and stars with same number of edges
• Decomposition of complete graphs into cycles and stars
• Decomposition of complete graphs into paths and stars
• Decompositions of complete graphs into paths and cycles.
• Graph theory with applications
• Multidecomposition of \(\lambda K_m\) into small cycles and claws
• Multidecompositions of complete bipartite graphs into cycles and stars
• Multidecompositions of the balanced complete bipartite graph into paths and stars
• Multidesigns for graph-pairs of order 4 and 5
• Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
• Sufficient Condition for {C 4, C 2t } - Decomposition of K 2m,2n – An Improved Bound

Cited in

(36)

• Decomposition of complete bipartite graphs into cycles and stars with four edges
• Decompositions of complete graphs into kayak paddles with two odd cycles
• scientific article; zbMATH DE number 5177321 (Why is no real title available?)
• Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles
• Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges
• Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
• Path decompositions of \(\lambda K_{n,n}\)
• Euler tours of maximum girth in \(K_{2n+1}\) and \(K_{2n,2n}\)
• scientific article; zbMATH DE number 5917766 (Why is no real title available?)
• Decomposition of complete tripartite graphs into cycles and paths of length three
• Decomposition of hypercube graphs into paths and cycles of length four
• Decomposition of product graphs into paths and cycles of length four
• Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each
• Decomposition of the Johnson graphs into graph-pairs of order 4
• Path and cycle decompositions of complete equipartite graphs: Four parts
• scientific article; zbMATH DE number 812067 (Why is no real title available?)
• Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs
• Decomposition of complete bipartite graphs into open trails
• Decomposition of the complete bipartite graph with a 1-factor removed into paths and stars
• On the cyclic decomposition of circulant graphs into bipartite graphs
• Decomposition of Bipartite Graphs Into Paths
• Decomposition of complete bipartite graphs into paths and stars with same number of edges
• Decomposition of complete Tripartite graphs into triangles and claws
• Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars
• Decomposition of complete equipartite graphs into paths and cycles of length \(2p\)
• \(K_n( \lambda )\) is fully \(\{P_5,C_6\}\)-decomposable
• Decomposition of complete uniform multi‐hypergraphs into Berge paths and cycles
• Minimal path decomposition of complete bipartite graphs
• Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length
• Decompositions of complete graphs and complete bipartite graphs into bipartite cubic graphs of order at most 12
• Decomposition of complete graphs into isomorphic complete bipartite graphs
• scientific article; zbMATH DE number 2210802 (Why is no real title available?)
• Decomposition of complete bipartite graphs into cycles of distinct even lengths
• Decomposition of product graphs into paths and stars on five vertices
• Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges
• Decompositions of line graphs of complete graphs into paths and cycles

This page was built for publication: Decomposition of complete bipartite graphs into paths and cycles

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