Gregarious Y₅-tree decompositions of tensor product of complete graphs
From MaRDI portal
Publication:6558937
Recommendations
Cites work
- scientific article; zbMATH DE number 3650602 (Why is no real title available?)
- scientific article; zbMATH DE number 7225155 (Why is no real title available?)
- scientific article; zbMATH DE number 3710227 (Why is no real title available?)
- A proof of Ringel's conjecture
- Almost every tree with \(m\) edges decomposes \(K_{2m,2m}\)
- Decomposition of Cartesian products of regular graphs into isomorphic trees
- Decomposition of complete graphs into arbitrary trees
- Decomposition of complete graphs into trees
- Decompositions of regular bipartite graphs
- Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
- Gregarious kite decomposition of tensor product of complete graphs
- Gregarious kite factorization of tensor product of complete graphs
Cited in
(2)
This page was built for publication: Gregarious \(Y_5\)-tree decompositions of tensor product of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6558937)