Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges

DOI10.1007/S00373-015-1623-5zbMath1339.05305OpenAlexW1855352450MaRDI QIDQ293622

Sadegheh Haghshenas, Nabil Shalaby, Danny Dyer

Publication date: 9 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: http://research.library.mun.ca/11679/1/Constructing_the_spectrum_of_packings_and_coverings_of_the_complete_graph_with_stars_that_have_up_to_five_edges.pdf

zbMATH Keywords

coveringpackingexcess graphleave graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

The spectrum of optimal excess graphs for trees with up to four edges ⋮ Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing cycles in complete graphs
• Packing paths in complete graphs
• Packing and covering of the complete graph with a graph G of four vertices or less
• The packing and covering of the complete graph. I: The forests of order five
• Decomposition of complete multigraphs into stars
• On claw-decomposition of complete graphs and complete bigraphs
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Graph decompositions, handcuffed prisoners and balanced p-designs
• A survey on the existence ofG-Designs

This page was built for publication: Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges