Decomposing highly connected graphs into paths of length five

DOI10.1016/J.DAM.2016.08.001MaRDI QIDQ1752489zbMATH OpenOpenAlexFDO

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

Publication date 24 May 2018

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2016.08.001

zbMATH Keywords

decomposition of graphs into pathsdecomposition of highly connected graphstree decomposition conjecturedecomposition conjecture of Barát and Thomassen

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Decompositions of highly connected graphs into paths of length five
• Decompositions of highly connected graphs into paths of any given length
• Decomposing highly edge-connected graphs into paths of any given length
• Decomposing graphs into paths of fixed length
• Decomposing graphs into paths and trees

Cites work

• scientific article; zbMATH DE number 4075098 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• A Reduction Method for Edge-Connectivity in Graphs
• Claw‐decompositions and tutte‐orientations
• Connected Detachments of Graphs and Generalized Euler Trails
• Decomposing a graph into bistars
• Decomposing graphs into paths of fixed length
• Decomposing highly edge-connected graphs into paths of any given length
• Decomposing regular graphs with prescribed girth into paths of given length
• Decompositions of highly connected graphs into paths of any given length
• Decompositions of highly connected graphs into paths of length 3
• Decompositions of highly connected graphs into paths of length five
• Decompositions of triangle-free 5-regular graphs into paths of length five
• Edge-Disjoint Spanning Trees of Finite Graphs
• Edge-decomposition of graphs into copies of a tree with four edges
• Edge-decompositions of highly connected graphs into paths
• Factors and factorizations of graphs. Proof techniques in factor theory
• From the theory of regular graphs of third and fourth degree
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• Graph theory
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• On the Problem of Decomposing a Graph into n Connected Factors
• P4-decompositions of regular graphs
• Path decompositions of regular graphs with prescribed girth
• Perfect path double covers of graphs
• Regular path decompositions of odd regular graphs
• The weak 3-flow conjecture and the weak circular flow conjecture
• Trois Types De Décompositions D'un Graphe En Chaînes

Cited in

(6)

• A proof of the Barát-Thomassen conjecture
• Decomposing graphs into paths of fixed length
• Decompositions of highly connected graphs into paths of any given length
• Decompositions of highly connected graphs into paths of length five
• Decomposing highly edge-connected graphs into paths of any given length
• Decomposing a graph into bistars

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

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