Decomposition of complete bipartite graphs into paths and stars with same number of edges

DOI10.1016/J.DISC.2012.12.020zbMath1260.05096OpenAlexW2084452371MaRDI QIDQ1942050

Tay-Woei Shyu

Publication date: 15 March 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Eulerian circuit

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph designs and isomorphic decomposition (05C51)

Related Items (10)

Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars ⋮ Decomposition of complete bipartite graphs into paths and cycles ⋮ Decomposition of complete multigraphs into stars and cycles ⋮ Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges ⋮ Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each ⋮ Decomposition of product graphs into paths and cycles of length four ⋮ Decompositions of line graphs of complete graphs into paths and cycles ⋮ Decomposition of complete bipartite graphs into cycles and stars with four edges ⋮ Decomposition of product graphs into paths and stars on five vertices ⋮ Decomposition of the complete bipartite multigraph into cycles and stars

This page was built for publication: Decomposition of complete bipartite graphs into paths and stars with same number of edges