| Maximum Hexagon Packing of $K_{v}-F$ Where $F$ is a Spanning Forest |
| Received:July 05, 2010 Revised:April 18, 2011 |
| Key Words:
6-cycle (Hexagon) leave complete graph forest packing.
|
| Fund Project:Supported by the National Natural Science Foundation of China (Grant No.11071163). |
|
| Hits: 3113 |
| Download times: 2851 |
| Abstract: |
| In this paper, we extend the result of packing the complete graph $K_{v}$ with 6-cycles (hexagons). Mainly, the maximum packing of $K_{v}-F$ is obtained where the leave is an odd spanning forest. |
| Citation: |
| DOI:10.3770/j.issn:2095-2651.2012.02.002 |
| View Full Text View/Add Comment |
