Decomposition of Cartesian products of regular graphs into isomorphic trees
From MaRDI portal
Publication:2449976
DOI10.4310/JOC.2013.V4.N4.A6zbMATH Open1290.05108MaRDI QIDQ2449976FDOQ2449976
Authors: Kyle F. Jao, Douglas B. West, Alexandr Kostochka 
Publication date: 13 May 2014
Published in: Journal of Combinatorics (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 1556732
- On decomposing even regular multigraphs into small isomorphic trees
- Graph decompositions for cartesian products
- Decompositions of graphs into trees
- Decompositions of graphs into trees, forests, and regular subgraphs
- Tree decompositions for a class of graphs
- Tree decompositions of multigraphs
- Decomposition of complete graphs into arbitrary trees
- Isomorphic decomposition of complete graphs into linear forests
- scientific article; zbMATH DE number 169203
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76) Graph designs and isomorphic decomposition (05C51)
Cited In (11)
- Gregarious \(Y_5\)-tree decompositions of tensor product of complete graphs
- On the decomposition of n‐cubes into isomorphic trees
- On decomposing even regular multigraphs into small isomorphic trees
- Decomposing 8-regular graphs into paths of length 4
- Path decompositions of regular graphs with prescribed girth
- Decomposing 10-regular graphs into paths of length 5
- Title not available (Why is that?)
- Decomposing \(2k\)-regular graphs into paths of length \(k\)
- Decompositions of triangle-free 5-regular graphs into paths of length five
- On decomposing regular graphs into isomorphic double-stars
- Decomposing regular graphs with prescribed girth into paths of given length
This page was built for publication: Decomposition of Cartesian products of regular graphs into isomorphic trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449976)
