Decompositions of highly connected graphs into paths of any given length

DOI10.1016/J.ENDM.2015.06.107zbMath1346.05225OpenAlexW2264650613MaRDI QIDQ324373

Yoshiko Wakabayashi, Marcio T. I. Oshiro, Fábio Botler, Guilherme Oliveira Mota

Publication date: 14 October 2016

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

zbMATH Keywords

path decompositionedge decompositionhighly connected

Mathematics Subject Classification ID

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

Related Items (3)

Path decompositions of regular graphs with prescribed girth ⋮ Decomposing highly edge-connected graphs into paths of any given length ⋮ Decomposing highly connected graphs into paths of length five

Cites Work

• Decomposing series-parallel graphs into paths of length 3 and triangles
• Path decompositions of regular graphs with prescribed girth
• Decompositions of highly connected graphs into paths of length five
• Edge-decomposition of graphs into copies of a tree with four edges
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Decomposing a graph into bistars
• Edge-decompositions of highly connected graphs into paths
• Decomposing graphs into paths of fixed length
• Decompositions of highly connected graphs into paths of length 3
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• Claw‐decompositions and tutte‐orientations
• Unnamed Item
• Unnamed Item
• Unnamed Item

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