Decompositions of highly connected graphs into paths of length five

DOI10.1016/J.ENDM.2015.07.036zbMath1347.05106arXiv1505.04309OpenAlexW2963595382MaRDI QIDQ324786

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

Publication date: 17 October 2016

Full work available at URL: https://arxiv.org/abs/1505.04309

zbMATH Keywords

path decompositionedge decompositionhighly connected

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (7)

Path decompositions of regular graphs with prescribed girth ⋮ Decompositions of highly connected graphs into paths of any given length ⋮ Decomposing highly edge-connected graphs into paths of any given length ⋮ Decomposing regular graphs with prescribed girth into paths of given length ⋮ Edge‐decomposing graphs into coprime forests ⋮ Decomposing graphs into paths and trees ⋮ Decomposing highly connected graphs into paths of length five

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-decomposition of graphs into copies of a tree with four edges
• The weak 3-flow conjecture and the weak circular flow conjecture
• Decomposing a graph into bistars
• Edge-decompositions of highly connected graphs into paths
• Decompositions of triangle-free 5-regular graphs into paths of length five
• 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

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