Decompositions of highly connected graphs into paths of length 3
From MaRDI portal
Publication:3630834
DOI10.1002/jgt.20311zbMath1214.05134OpenAlexW4242000175WikidataQ56926624 ScholiaQ56926624MaRDI QIDQ3630834
Publication date: 4 June 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20311
Related Items (23)
A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs ⋮ Decomposing series-parallel graphs into paths of length 3 and triangles ⋮ 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 homomorphic copies of a fixed tree ⋮ Decomposing highly edge-connected graphs into paths of any given length ⋮ Edge‐decomposing graphs into coprime forests ⋮ Edge-decomposition of graphs into copies of a tree with four edges ⋮ Decomposing graphs into paths and trees ⋮ The weak 3-flow conjecture and the weak circular flow conjecture ⋮ Hamilton path decompositions of complete multipartite graphs ⋮ Decomposing a graph into bistars ⋮ Decomposing graphs into paths of fixed length ⋮ On specific factors in graphs ⋮ Minimal path decomposition of complete bipartite graphs ⋮ A proof of the Barát-Thomassen conjecture ⋮ Pack graphs with subgraphs of size three ⋮ Decomposing highly connected graphs into paths of length five ⋮ Packing paths in complete graphs ⋮ What is on his mind? ⋮ Ear decompositions of a cubic bridgeless graph and near P4-decompositions of its deck ⋮ Spanning trees and spanning Eulerian subgraphs with small degrees ⋮ Star decomposition of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Girth in graphs
- Edge-decompositions of highly connected graphs into paths
- Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- On partitioning the edges of graphs into connected subgraphs
- A Reduction Method for Edge-Connectivity in Graphs
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Claw‐decompositions and tutte‐orientations
- Minimum partition of a matroid into independent subsets
This page was built for publication: Decompositions of highly connected graphs into paths of length 3
