Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
From MaRDI portal
Publication:345073
DOI10.1016/j.jctb.2016.05.005zbMath1350.05081arXiv1603.00198OpenAlexW2964047817MaRDI QIDQ345073
Publication date: 25 November 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.00198
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items
Edge‐decomposing graphs into coprime forests ⋮ Modulo orientations with bounded out-degrees ⋮ Decomposing graphs into paths and trees ⋮ A proof of the Barát-Thomassen conjecture
Cites Work
- 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
- Bounded degree spanning trees (extended abstract)
- Edge-decompositions of highly connected graphs into paths
- On a theorem of Mader
- Spanning trees and spanning Eulerian subgraphs with small degrees
- Decomposing graphs into paths of fixed length
- Connected (g, f)-factors
- 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
- On partitioning the edges of graphs into connected subgraphs
- A Reduction Method for Edge-Connectivity in Graphs
- On low bound of degree sequences of spanning trees inK-edge-connected graphs
- Claw‐decompositions and tutte‐orientations
