The real truth about star designs

DOI10.1016/J.DISC.2004.02.002zbMath1061.90007OpenAlexW2001829315MaRDI QIDQ1876685

D. G. Hoffman

Publication date: 20 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.02.002

zbMATH Keywords

Network flowsGraph designs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

A cube dismantling problem related to bootstrap percolation ⋮ Smaller embeddings of partial \(k\)-star decompositions ⋮ Decompositions of complete multigraphs into stars of varying sizes ⋮ Decomposition of balanced complete bipartite multigraphs into multistars ⋮ Decomposition of the complete bipartite multigraph into cycles and stars

Cites Work

• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• Paths, Trees, and Flowers
• Unnamed Item

This page was built for publication: The real truth about star designs