Decomposing a graph into bistars

DOI10.1016/J.JCTB.2013.05.003MaRDI QIDQ463290zbMATH OpenOpenAlexDBLPWikidataFDO

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

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) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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

Cites work

• scientific article; zbMATH DE number 3904637 (Why is no real title available?)
• scientific article; zbMATH DE number 4075098 (Why is no real title available?)
• A Reduction Method for Edge-Connectivity in Graphs
• Claw‐decompositions and tutte‐orientations
• Decomposing graphs into paths of fixed length
• Decompositions of highly connected graphs into paths of length 3
• Edge-Disjoint Spanning Trees of Finite Graphs
• Edge-decomposition of graphs into copies of a tree with four edges
• Edge-decompositions of highly connected graphs into paths
• Minimum partition of a matroid into independent subsets
• On some connectivity properties of Eulerian graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• The weak 3-flow conjecture and the weak circular flow conjecture

Cited in

(13)

• The breakdowns of BiCGStab
• Decomposing highly connected graphs into paths of length five
• Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
• Graph factors modulo \(k\)
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Edge-decomposition of graphs into copies of a tree with four edges
• Decomposing graphs into paths and trees
• Decompositions of highly connected graphs into paths of any given length
• Decompositions of highly connected graphs into paths of length five
• A proof of the Barát-Thomassen conjecture
• Star decomposition of graphs
• Decomposing highly edge-connected graphs into paths of any given length
• Edge‐decomposing graphs into coprime forests

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)