Multidecomposition of Cartesian product of some graphs into even cycles and matchings
DOI10.2298/FIL1718525KzbMATH Open1499.05520OpenAlexW2796404939WikidataQ130027797 ScholiaQ130027797MaRDI QIDQ5019802FDOQ5019802
Publication date: 11 January 2022
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil1718525k
Recommendations
- Multidecompositions of complete bipartite graphs into cycles and stars
- Decomposition of the complete bipartite multigraph into cycles and stars
- Multidecompositions of the balanced complete bipartite graph into paths and stars
- Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges
- Hamilton decompositions of cartesian products of multicycles
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Multidesigns for graph-pairs of order 4 and 5
- Decomposition of complete graphs into cycles and stars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposition of complete graphs into paths and stars
- Multidecompositions of several graph products
- Decomposition of complete graphs into paths of length three and triangles.
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Multidecomposition of Cartesian product of some graphs into even cycles and matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5019802)