Back to Search
Start Over
Constructing the Spectrum of Packings and Coverings for the Complete Graph with Stars with up to Five Edges.
- Source :
- Graphs & Combinatorics; May2016, Vol. 32 Issue 3, p943-961, 19p
- Publication Year :
- 2016
-
Abstract
- The packing and covering problems have been considered for several classes of graphs. For instance, Bryant et. al. have investigated the packing problem for paths and cycles, and the packing and covering problems for 3-cubes. The packing and covering problems were settled for stars with up to six edges by Roditty. In this paper, for every possible leave graph (excess graph), we find a corresponding maximum packing (minimum covering) of the complete graph with stars with up to five edges. [ABSTRACT FROM AUTHOR]
- Subjects :
- GRAPH theory
GEOMETRY
GRAPHIC methods
EDGES (Geometry)
ALGEBRAIC cycles
Subjects
Details
- Language :
- English
- ISSN :
- 09110119
- Volume :
- 32
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- Graphs & Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 114786778
- Full Text :
- https://doi.org/10.1007/s00373-015-1623-5