Decompositions of highly connected graphs into paths of any given length

DOI10.1016/J.ENDM.2015.06.107MaRDI QIDQ324373zbMATH OpenOpenAlexFDO

Authors M. T. I. Oshiro, Yoshiko Wakabayashi, F. Botler, G. O. Mota

Publication date 14 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2015.06.107

zbMATH Keywords

edge decompositionhighly connectedpath decomposition

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Decomposing highly edge-connected graphs into paths of any given length
• Edge-decompositions of highly connected graphs into paths
• Decompositions of highly connected graphs into paths of length 3
• Path decomposition of graphs with given path length
• Decomposing graphs into paths of fixed length
• Decomposing highly connected graphs into paths of length five
• Decompositions of highly connected graphs into paths of length five
• Decomposing regular graphs with prescribed girth into paths of given length
• Decompositions of a complete multidigraph into almost arbitrary paths
• Decomposing graphs into long paths

Cites work

• Claw‐decompositions and tutte‐orientations
• Decomposing a graph into bistars
• Decomposing graphs into paths of fixed length
• Decomposing series-parallel graphs into paths of length 3 and triangles
• Decompositions of highly connected graphs into paths of length 3
• Decompositions of highly connected graphs into paths of length five
• Edge-decomposition of graphs into copies of a tree with four edges
• Edge-decompositions of highly connected graphs into paths
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• Graph theory
• scientific article; zbMATH DE number 4075098 (Why is no real title available?)
• scientific article; zbMATH DE number 3253072 (Why is no real title available?)
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Path decompositions of regular graphs with prescribed girth

Cited in

(12)

• Edge-decompositions of highly connected graphs into paths
• Decomposing graphs into paths and trees
• Decomposing highly connected graphs into paths of length five
• A proof of the Barát-Thomassen conjecture
• Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture
• Decomposing graphs into paths of fixed length
• Path decompositions of regular graphs with prescribed girth
• Decompositions of highly connected graphs into paths of length five
• Decomposing highly edge-connected graphs into paths of any given length
• Decompositions of highly connected graphs into paths of length 3
• Edge-decomposition of graphs into copies of a tree with four edges
• Decomposing a graph into bistars

This page was built for publication: Decompositions of highly connected graphs into paths of any given length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324373)