Edge‐decomposing graphs into coprime forests
From MaRDI portal
Publication:6055926
DOI10.1002/jgt.22638zbMath1521.05160arXiv1803.03704OpenAlexW3096001687MaRDI QIDQ6055926
Steéphan Thomassé, Tereza Klimošová
Publication date: 29 September 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.03704
Related Items (1)
Cites Work
- 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-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
- Bounded degree spanning trees (extended abstract)
- Edge-decompositions of highly connected graphs into paths
- A proof of the Barát-Thomassen conjecture
- Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture
- 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
- Decompositions of highly connected graphs into paths of length 3
- Claw‐decompositions and tutte‐orientations
This page was built for publication: Edge‐decomposing graphs into coprime forests
