Decomposing a graph into bistars

DOI10.1016/J.JCTB.2013.05.003zbMath1301.05272DBLPjournals/jct/Thomassen13OpenAlexW2030926222WikidataQ56926556 ScholiaQ56926556MaRDI QIDQ463290

Carsten Thomassen

Publication date: 16 October 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2013.05.003

zbMATH Keywords

3-flow conjectureorientations modulo \(k\)bistar decomposition

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (12)

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 ⋮ Graph factors modulo \(k\) ⋮ Edge-decomposition of graphs into copies of a tree with four edges ⋮ Decomposing graphs into paths and trees ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations ⋮ A proof of the Barát-Thomassen conjecture ⋮ Decomposing highly connected graphs into paths of length five ⋮ Star decomposition of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Edge-decomposition of graphs into copies of a tree with four edges
• The weak 3-flow conjecture and the weak circular flow conjecture
• Edge-decompositions of highly connected graphs into paths
• 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
• On some connectivity properties of Eulerian graphs
• A Reduction Method for Edge-Connectivity in Graphs
• Claw‐decompositions and tutte‐orientations
• Minimum partition of a matroid into independent subsets

This page was built for publication: Decomposing a graph into bistars