Minimum Coverings of Crowns with Cycles and Stars
Let F, G and H be graphs. A (G, H)-decomposition of F is a partition of the edge set of F into copies of G and copies of H with at least one copy of G and at least one copy of H. For R ⊆ F, a (G, H)-covering of F with padding R is a (G, H)-decomposition of F + E(R). A (G, H)-covering of F with the s...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2022-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2241 |