Star decomposition of graphs

DOI10.1142/S1793830915500160zbMath1326.05090MaRDI QIDQ5261050

Baoyindureng Wu, Yang Zhao

Publication date: 1 July 2015

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

matchingfloworientationstar decomposition

Mathematics Subject Classification ID

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

Related Items (2)

FORK-DECOMPOSITION OF DIRECT PRODUCT OF GRAPHS ⋮ On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem

Cites Work

• Unnamed Item
• The weak 3-flow conjecture and the weak circular flow conjecture
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Decomposing a graph into bistars
• Factors and factorizations of graphs. Proof techniques in factor theory
• Edge-decompositions of highly connected graphs into paths
• On the decomposition of a graph into stars
• Claw-free graphs and 2-factors that separate independent vertices
• 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
• On Representatives of Subsets
• Claw‐decompositions and tutte‐orientations

This page was built for publication: Star decomposition of graphs