Year: 2017
Type: preprint
Abstract: A decomposition of $K_{n(g)}\setminus 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 $K_{n(g)}$ with G if L contains as few edges as possible. We examine all possible minimum leaves for maximum group divisible $(K_4-e)$-packings. Necessary and sufficient conditions are established for their existences.
Source: arXiv (Cornell University)
Authors: Gao, Y., Chang, Y., Feng, T.
Institutions: Beijing Jiaotong University, Tonghua Normal University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2618604346