2017
DOI: 10.1002/jcd.21600
|View full text |Cite
|
Sign up to set email alerts
|

Group divisible ‐packings with any minimum leave

Abstract: A decomposition of Kn(g)∖L, the complete n‐partite equipartite graph with a subgraph L (called the leave) removed, into edge disjoint copies of a graph G is called a maximum group divisible packing of Knfalse(gfalse) with G if L contains as few edges as possible. We examine all possible minimum leaves for maximum group divisible (K4−e)‐packings. Necessary and sufficient conditions are established for their existences.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
references
References 19 publications
(113 reference statements)
0
0
0
Order By: Relevance