Decomposition of Cartesian products of regular graphs into isomorphic trees
From MaRDI portal
Publication:2449976
DOI10.4310/JOC.2013.V4.N4.A6zbMath1290.05108MaRDI QIDQ2449976
Kyle F. Jao, Douglas B. West, Alexandr V. Kostochka
Publication date: 13 May 2014
Published in: Journal of Combinatorics (Search for Journal in Brave)
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76) Graph designs and isomorphic decomposition (05C51)
Related Items (8)
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 ⋮ Decomposing \(2k\)-regular graphs into paths of length \(k\) ⋮ Decomposing regular graphs with prescribed girth into paths of given length ⋮ On decomposing even regular multigraphs into small isomorphic trees ⋮ On decomposing regular graphs into isomorphic double-stars ⋮ Decompositions of triangle-free 5-regular graphs into paths of length five
This page was built for publication: Decomposition of Cartesian products of regular graphs into isomorphic trees
