Path decompositions of regular graphs with prescribed girth
From MaRDI portal
Publication:322341
DOI10.1016/J.ENDM.2015.06.085zbMATH Open1346.05132OpenAlexW2276833181MaRDI QIDQ322341FDOQ322341
M. T. I. Oshiro, F. Botler, Yoshiko Wakabayashi, G. O. Mota
Publication date: 14 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.085
Recommendations
- Decomposing regular graphs with prescribed girth into paths of given length
- Path decomposition of graphs with given path length
- On path decompositions of \(2 k\)-regular graphs
- Regular path decompositions of odd regular graphs
- On path decompositions of \(2k\)-regular graphs
- Decompositions of highly connected graphs into paths of any given length
- Decomposing \(2k\)-regular graphs into paths of length \(k\)
- Decomposing graphs into paths of fixed length
- Path decompositions and Gallai's conjecture
- A result on decompositions of regular graphs
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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decompositions of regular bipartite graphs
- Decompositions of triangle-free 5-regular graphs into paths of length five
- Decomposition of Cartesian products of regular graphs into isomorphic trees
- Decompositions of highly connected graphs into paths of any given length
- Decompositions of highly connected graphs into paths of length five
- From the theory of regular graphs of third and fourth degree
- Trois Types De Décompositions D'un Graphe En Chaînes
- Regular path decompositions of odd regular graphs
- Title not available (Why is that?)
- P4-decompositions of regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Claw‐decompositions and tutte‐orientations
Cited In (5)
- Graph decompositions and \(D_3\)-paths with a prescribed endvertex
- Decompositions of highly connected graphs into paths of any given length
- Decomposing highly connected graphs into paths of length five
- Decompositions of triangle-free 5-regular graphs into paths of length five
- On path decompositions of \(2 k\)-regular graphs
This page was built for publication: Path decompositions of regular graphs with prescribed girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322341)
