Decomposition of complete bipartite graphs into paths and cycles

DOI10.1016/J.DISC.2014.05.009zbMATH Open1297.05190OpenAlexW2004155392MaRDI QIDQ397156FDOQ397156

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

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

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)

Cites Work

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

Cited In (31)

• Title not available (Why is that?)
• Decompositions of complete graphs into kayak paddles with two odd cycles
• Decomposition of hypercube graphs into paths and cycles of length four
• Decomposition of complete bipartite graphs into open trails
• Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges
• Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each
• Decomposition of Bipartite Graphs Into Paths
• Decomposition of complete uniform multi‐hypergraphs into Berge paths and cycles
• Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
• Path decompositions of \(\lambda K_{n,n}\)
• Path and cycle decompositions of complete equipartite graphs: Four parts
• Decomposition of complete Tripartite graphs into triangles and claws
• Title not available (Why is that?)
• Decomposition of complete bipartite graphs into paths and stars with same number of edges
• Decomposition of the Johnson graphs into graph-pairs of order 4
• Title not available (Why is that?)
• Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges
• Decomposition of product graphs into paths and stars on five vertices
• Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles
• Decomposition of complete equipartite graphs into paths and cycles of length \(2p\)
• Decomposition of complete tripartite graphs into cycles and paths of length three
• Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars
• Decomposition of complete bipartite graphs into cycles and stars with four edges
• Decomposition of product graphs into paths and cycles of length four
• Title not available (Why is that?)
• On the cyclic decomposition of circulant graphs into bipartite graphs
• Euler tours of maximum girth in \(K_{2n+1}\) and \(K_{2n,2n}\)
• Title not available (Why is that?)
• Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs
• Title not available (Why is that?)
• 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)