Multidesigns for graph-pairs of order 4 and 5

From MaRDI portal
Publication:1423489

DOI10.1007/s00373-003-0530-3zbMath1032.05105OpenAlexW2031775640MaRDI QIDQ1423489

Mike Daven, Atif A. Abueida

Publication date: 4 March 2004

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-003-0530-3




Related Items

Multidecompositions of several graph productsDecomposing the complete graph into Hamiltonian paths (cycles) and 3-starsDecomposition of the complete bipartite graph with a 1-factor removed into cycles and starsDecomposition of complete bipartite graphs into paths and cyclesDecomposition of complete multigraphs into stars and cyclesDecomposition of complete bipartite multigraphs into paths and cycles having \(k\) edgesDecomposition of complete graphs into cycles and starsMultidecompositions of the balanced complete bipartite graph into paths and starsDecompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges eachOn the decompositions of complete graphs into cycles and stars on the same number of edgesPack graphs with subgraphs of size threeDecompositions of multicrowns into cycles and starsUnnamed ItemDecomposition of complete graphs into paths and starsDecomposition of product graphs into paths and cycles of length fourMultidesigns for the graph pair formed by the 6-cycle and 3-prismDecomposition of complete equipartite graphs into paths and cycles of length \(2p\)Decompositions of line graphs of complete graphs into paths and cyclesDecomposition of complete bipartite graphs into cycles and stars with four edgesDecomposition of product graphs into paths and stars on five verticesDecomposition of the complete bipartite multigraph into cycles and starsMultidecomposition of cartesian product of some graphs into even cycles and matchings