Gregarious Decompositions of Complete Equipartite Graphs and Related Structures
In a finite mathematical structure with a given partition, a substructure is said to be gregarious if either it meets each partition class or it shares at most one element with each partition class. In this paper, we considered edge decompositions of graphs and hypergraphs into gregarious subgraphs...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-11-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/15/12/2097 |