Decomposing highly connected graphs into paths of length five
DOI10.1016/j.dam.2016.08.001zbMath1387.05189OpenAlexW2507265545MaRDI QIDQ1752489
Fábio Botler, Yoshiko Wakabayashi, Guilherme Oliveira Mota, Marcio T. I. Oshiro
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
decomposition conjecture of Barát and Thomassendecomposition of graphs into pathsdecomposition of highly connected graphstree decomposition conjecture
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Connectivity (05C40)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Path decompositions of regular graphs with prescribed girth
- 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
- Edge-decomposition of graphs into copies of a tree with four edges
- The weak 3-flow conjecture and the weak circular flow conjecture
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Decomposing a graph into bistars
- Factors and factorizations of graphs. Proof techniques in factor theory
- Edge-decompositions of highly connected graphs into paths
- Decompositions of triangle-free 5-regular graphs into paths of length five
- Decomposing regular graphs with prescribed girth into paths of given length
- Decomposing graphs into paths of fixed length
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- 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
- Decompositions of highly connected graphs into paths of length 3
- Connected Detachments of Graphs and Generalized Euler Trails
- A Reduction Method for Edge-Connectivity in Graphs
- P4-decompositions of regular graphs
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Perfect path double covers of graphs
- Claw‐decompositions and tutte‐orientations
This page was built for publication: Decomposing highly connected graphs into paths of length five
