On the decomposition of a graph into stars
From MaRDI portal
Publication:1155633
DOI10.1016/S0012-365X(81)80025-8zbMath0467.05054OpenAlexW2089323022MaRDI QIDQ1155633
Publication date: 1981
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(81)80025-8
Related Items (17)
Decompositions of hypergraphs into hyperstars ⋮ Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\) ⋮ Star factorizations of graph products ⋮ Smaller embeddings of partial \(k\)-star decompositions ⋮ Decompositions of complete multigraphs into stars of varying sizes ⋮ On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem ⋮ Star coloring planar graphs from small lists ⋮ Pack graphs with subgraphs of size three ⋮ Colorings and orientations of graphs ⋮ Partitions, packings and coverings by families with nonempty intersections ⋮ Embedding Partial k‐Star Designs ⋮ Packing, covering and decomposing of a complete uniform hypergraph into delta-systems ⋮ Decomposition of balanced complete bipartite multigraphs into multistars ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ The oriented cycle game ⋮ Packing and covering of the complete graph with a graph G of four vertices or less ⋮ Star decomposition of graphs
Cites Work
This page was built for publication: On the decomposition of a graph into stars
