Decomposing a graph into bistars
DOI10.1016/J.JCTB.2013.05.003zbMATH Open1301.05272DBLPjournals/jct/Thomassen13OpenAlexW2030926222WikidataQ56926556 ScholiaQ56926556MaRDI QIDQ463290FDOQ463290
Authors: 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
Recommendations
- Decomposing highly edge-connected graphs into paths of any given length
- Edge-decomposition of graphs into copies of a tree with four edges
- Decompositions of highly connected graphs into paths of any given length
- Decomposing highly connected graphs into paths of length five
- Decompositions of highly connected graphs into paths of length five
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- A Reduction Method for Edge-Connectivity in Graphs
- Minimum partition of a matroid into independent subsets
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Decompositions of highly connected graphs into paths of length 3
- Edge-decomposition of graphs into copies of a tree with four edges
- Claw‐decompositions and tutte‐orientations
- On some connectivity properties of Eulerian graphs
Cited In (13)
- Decomposing graphs into paths and trees
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Edge‐decomposing graphs into coprime forests
- The breakdowns of BiCGStab
- Decompositions of highly connected graphs into paths of any given length
- Decompositions of highly connected graphs into paths of length five
- Star decomposition of graphs
- Decomposing highly edge-connected graphs into paths of any given length
- Graph factors modulo \(k\)
- Edge-decomposition of graphs into copies of a tree with four edges
- Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
- Decomposing highly connected graphs into paths of length five
- A proof of the Barát-Thomassen conjecture
This page was built for publication: Decomposing a graph into bistars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463290)
