Contents

Ars Combinatoria

  • Research article

Maximum Hexagon Packing of \(K_v – L\) Where \(L\) is a \(2\)-Regular Subgraph

Liqun Pu1, Yanling Chai1, Hailin Bu1
1Department of Mathematics, Zhengzhou University, Zhengzhou 450001, China
  • Published: 31/10/2013

Abstract

In this paper, we extend the study on packing complete graphs \(K_v\) with \(6\)-cycles. Mainly, we obtain the maximum packing of \(K_v – L\) and a leave, where \(L\) is a vertex-disjoint union of cycles in \(K_v\).

Citation
Liqun Pu, Yanling Chai, Hailin Bu. Maximum Hexagon Packing of \(K_v – L\) Where \(L\) is a \(2\)-Regular Subgraph[J], Ars Combinatoria, Volume 112. 225-237. .