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: | Lin Jenq-Jong, Jou Min-Jen |
---|---|
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 |
Similar Items
-
On Double-Star Decomposition of Graphs
by: Akbari Saieed, et al.
Published: (2017-08-01) -
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
by: Lee Hung-Chih, et al.
Published: (2020-08-01) -
Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each
by: Shyu Tay-Woei
Published: (2021-05-01) -
The Spectrum Problem for the Connected Cubic Graphs of Order 10
by: Adams Peter, et al.
Published: (2021-11-01) -
Decomposition of the Tensor Product of Complete Graphs into Cycles of Lengths 3 and 6
by: Paulraja P., et al.
Published: (2021-02-01)