Gregarious \(Y_5\)-tree decompositions of tensor product of complete graphs

DOI10.61091/jcmcc117-17zbMath1541.05136MaRDI QIDQ6558937

S. Sankara Gomathi, A. Tamil Elakkiya

Publication date: 21 June 2024

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

decompositiontensor product\(Y_5\)-treegregarious \(Y_5\)-tree

Mathematics Subject Classification ID

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gregarious kite decomposition of tensor product of complete graphs
• Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
• Decompositions of regular bipartite graphs
• Decomposition of complete graphs into arbitrary trees
• A proof of Ringel's conjecture
• Gregarious kite factorization of tensor product of complete graphs
• Decomposition of Cartesian products of regular graphs into isomorphic trees
• Decomposition of complete graphs into trees
• Almost Every Tree With m Edges Decomposes K_2m,2m

This page was built for publication: Gregarious \(Y_5\)-tree decompositions of tensor product of complete graphs