Edge-decomposition of graphs into copies of a tree with four edges

zbMath1300.05243arXiv1203.1671MaRDI QIDQ405153

Dániel Gerbner, János Barát

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.1671

zbMATH Keywords

treedecompositionedge-connectivity

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Graph designs and isomorphic decomposition (05C51)

Related Items (13)

FORK-DECOMPOSITION OF DIRECT PRODUCT OF GRAPHS ⋮ 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 ⋮ Modulo orientations with bounded out-degrees ⋮ Decomposing graphs into paths and trees ⋮ Decomposing a graph into bistars ⋮ A proof of the Barát-Thomassen conjecture ⋮ Decomposing highly connected graphs into paths of length five ⋮ Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm ⋮ Spanning trees and spanning Eulerian subgraphs with small degrees

Cites Work

• The weak 3-flow conjecture and the weak circular flow conjecture
• Decomposing a graph into bistars
• Edge-connectivity and edge-disjoint spanning trees
• Edge-decompositions of highly connected graphs into paths
• 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
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• Claw‐decompositions and tutte‐orientations

This page was built for publication: Edge-decomposition of graphs into copies of a tree with four edges