On path decompositions of 2 k-regular graphs
From MaRDI portal
Publication:2400577
Recommendations
- On path decompositions of \(2k\)-regular graphs
- Decomposing 2k-regular graphs into paths of length k
- Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\)
- Decomposition of (2k + 1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k + 1
- Path decompositions of regular graphs with prescribed girth
- 2p-cycle decompositions of some regular graphs and digraphs
- On cyclic decompositions of the complete graph into the 2-regular graphs
- Path decompositions of Kneser and generalized Kneser graphs
- Regular path decompositions of odd regular graphs
- scientific article; zbMATH DE number 1885943
Cites work
- scientific article; zbMATH DE number 3948320 (Why is no real title available?)
- scientific article; zbMATH DE number 6303054 (Why is no real title available?)
- scientific article; zbMATH DE number 3243267 (Why is no real title available?)
- An upper bound for the path number of a graph
- Covering the edges of a connected graph by paths
- Decomposing graphs into paths of fixed length
- Decompositions of triangle-free 5-regular graphs into paths of length five
- From the theory of regular graphs of third and fourth degree
- On path decompositions of \(2k\)-regular graphs
- Path decomposition of graphs with given path length
- Path decompositions and Gallai's conjecture
- Path decompositions of regular graphs with prescribed girth
- Regular path decompositions of odd regular graphs
Cited in
(19)- An overview of graph covering and partitioning
- Gallai's conjecture for disconnected graphs
- Gallai's path decomposition conjecture for triangle-free planar graphs
- Gallai's conjecture for graphs with treewidth 3
- Path decompositions of triangle-free graphs
- Decomposing 8-regular graphs into paths of length 4
- Path decompositions of regular graphs with prescribed girth
- On path decompositions of \(2k\)-regular graphs
- Decompositions of 6-regular bipartite graphs into paths of length six
- On Gallai's conjecture for graphs with maximum degree 6
- Gallai's path decomposition conjecture for graphs with maximum \(E\)-degree at most 3
- Transitive path decompositions of Cartesian products of complete graphs
- Path and cycle decompositions of dense graphs
- Hamilton path decompositions of complete multipartite graphs
- Gallai's conjecture for 3-degenerated graphs
- Gallai's conjecture on path decompositions
- Towards Gallai's path decomposition conjecture
- On computing the path number of a graph
- scientific article; zbMATH DE number 5914937 (Why is no real title available?)
This page was built for publication: On path decompositions of \(2 k\)-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2400577)
