On path decompositions of 2 k-regular graphs
From MaRDI portal
Publication:2400577
DOI10.1016/J.DISC.2016.09.029zbMATH Open1369.05167OpenAlexW2962972517MaRDI QIDQ2400577FDOQ2400577
Authors: F. Botler, Andrea Jiménez 
Publication date: 29 August 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.09.029
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
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Path decompositions and Gallai's conjecture
- Covering the edges of a connected graph by paths
- Decompositions of triangle-free 5-regular graphs into paths of length five
- Decomposing graphs into paths of fixed length
- Path decompositions of regular graphs with prescribed girth
- On path decompositions of \(2k\)-regular graphs
- From the theory of regular graphs of third and fourth degree
- Regular path decompositions of odd regular graphs
- Title not available (Why is that?)
- An upper bound for the path number of a graph
- Title not available (Why is that?)
- Path decomposition of graphs with given path length
Cited In (16)
- 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
- Decompositions of 6-regular bipartite graphs into paths of length six
- Path decompositions of regular graphs with prescribed girth
- On Gallai's conjecture for graphs with maximum degree 6
- Gallai's path decomposition conjecture for graphs with maximum \(E\)-degree at most 3
- 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
- Title not available (Why is that?)
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)
