Group divisible (K₄-e)-packings with any minimum leave

DOI10.1002/JCD.21600MaRDI QIDQ6287069zbMATH OpenOpenAlexFDO

Authors Yufeng Gao, Yanxun Chang, Tao Feng

Publication date 24 May 2017

Full work available at URL https://doi.org/10.1002/jcd.21600

Mathematics Subject Classification ID

Combinatorics (05-XX)

Abstract: A decomposition of $K_{n(g)}setminusL$, 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.

Recommendations

• Maximum packings of \(K_ n\) with copies of \(K_ 4-e\)
• Group divisible packings and coverings with any minimum leave and minimum excess
• Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
• Packing complete multipartite graphs with 4-cycles
• Leaves for packings with block size four

Cited in

(1)

• Kite-group divisible packings and coverings with any minimum leave and minimum excess

This page was built for publication: Group divisible (K_4-e)-packings with any minimum leave

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6287069)