Decompositions of some regular graphs into unicyclic graphs of order five
From MaRDI portal
Publication:5197547
DOI10.1142/S1793830919500423zbMath1420.05111OpenAlexW2955208706WikidataQ127610601 ScholiaQ127610601MaRDI QIDQ5197547
Publication date: 18 September 2019
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830919500423
Graph operations (line graphs, products, etc.) (05C76) Graph designs and isomorphic decomposition (05C51)
Related Items (2)
Decompositions of some regular graphs into unicyclic graphs of order five ⋮ Edge geodetic self-decomposition in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decompositions of complete multigraphs into cycles of varying lengths
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Balanced incomplete block designs and related designs
- Group divisible designs with block-size four
- \(G\)-decomposition of \(K_n\), where G has four vertices or less
- Modified group divisible designs with block size 4 and \(\lambda=1\)
- An application of modified group divisible designs
- On Hamilton cycle decompositions of the tensor product of complete graphs
- Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
- Modified group divisible designs with block size four
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Decompositions of complete multipartite graphs into cycles of even length
- \(C_{p}\)-decompositions of some regular graphs
- Decomposition of a complete bipartite multigraph into arbitrary cycle sizes
- Group divisible designs with block size four. (Reprint)
- The Existence and Construction of Balanced Incomplete Block Designs
- Isomorphic decomposition of complete graphs into linear forests
- On the decomposition ofkn into complete bipartite graphs
- On the decomposition of Kn into complete m‐partite graphs
- Cycle decompositions V: Complete graphs into cycles of arbitrary lengths
- Decompositions of some regular graphs into unicyclic graphs of order five
- Cycle decompositions of complete multigraphs
This page was built for publication: Decompositions of some regular graphs into unicyclic graphs of order five
