Decomposition of complete bipartite multigraphs into paths and cycles having k edges
From MaRDI portal
Publication:891319
DOI10.7151/DMGT.1830zbMATH Open1327.05174OpenAlexW2518069832MaRDI QIDQ891319FDOQ891319
Authors: S. Jeevadoss, A. Muthusamy 
Publication date: 17 November 2015
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1830
Recommendations
- Decomposition of complete bipartite graphs into paths and cycles
- scientific article; zbMATH DE number 3943845
- Decomposition of a complete bipartite multigraph into arbitrary cycle sizes
- On the cyclic decomposition of complete graphs into bipartite graphs
- Decomposition of the complete bipartite multigraph into cycles and stars
- scientific article; zbMATH DE number 786153
- Decompositions of complete multipartite graphs into cycles of even length
- Decomposition of complete equipartite graphs into paths and cycles of length \(2p\)
- Decomposition of complete bipartite graphs into cycles of distinct even lengths
- Multidecompositions of complete bipartite graphs into cycles and stars
Cites Work
- Graph theory with applications
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- 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
- Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars
- Multidecompositions of complete bipartite graphs into cycles and stars
- 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?)
- Decomposition of complete bipartite graphs into paths and cycles
- On the decompositions of complete graphs into cycles and stars on the same number of edges
- Multidecompositions of several graph products
- Decomposition of complete graphs into paths of length three and triangles.
- Multidecomposition of \(K_n-F\) into graph-pairs of order 5 where \(F\) is a Hamilton cycle or an (almost) 1-factor.
- Title not available (Why is that?)
Cited In (23)
- Decomposition of hypercube graphs into paths and cycles of length four
- Decomposition of complete bipartite graphs into paths and cycles
- Decomposition of balanced complete bipartite multigraphs into multistars
- Small 2-coloured path decompositions.
- Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each
- Decomposition of complete uniform multi‐hypergraphs into Berge paths and cycles
- Path decompositions of \(\lambda K_{n,n}\)
- Decompositions of a \(\lambda K_{m,n}\) into graphs of four vertices and five edges
- 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
- \(K_n( \lambda )\) is fully \(\{P_5,C_6\}\)-decomposable
- Decomposition of product graphs into paths and stars on five vertices
- Title not available (Why is that?)
- Decomposition of complete equipartite graphs into paths and cycles of length \(2p\)
- Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars
- Title not available (Why is that?)
- Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
- Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length
- Decomposition of a complete bipartite multigraph into arbitrary cycle sizes
- Hamilton path decompositions of complete multipartite graphs
- Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs
- Multidecomposition of Cartesian product of some graphs into even cycles and matchings
- Balanced path decomposition of \(\lambda K_{n,n}\) and \(\lambda K^*_{n,n}\)
This page was built for publication: Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891319)
