Maximum Packings and Minimum Coverings of Kv with Octagons

被引：8

作者：

Li, Mingchao ^{[1
]}

Huo, Jingjing ^{[1
]}

Gao, Zhichao ^{[1
]}

机构：

[1] Hebei Univ Engn, Coll Sci, Handan 056038, Peoples R China

来源：

GRAPHS AND COMBINATORICS | 2009年 / 25卷 / 05期

关键词：

G-packing; G-covering; Leave; Repeat; Nonisomorphic graph; 4-CYCLES; GRAPHS;

D O I：

10.1007/s00373-010-0879-z

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this paper, we completely settle the maximum packing and minimum covering problem of K-v with octagons for v odd, give the maximum G-packing (minimum G-covering) for all possible leaves(repeats).

引用

页码：735 / 752

页数：18

共 8 条

[1] Cycle decompositions of Kn and Kn-I
Alspach, B
Gavlas, H
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2001, 81 (01) : 77 - 99
[2] Packing λ-fold complete multipartite graphs with 4-cycles
Billington, EJ
Fu, HL
Rodger, CA
[J]. GRAPHS AND COMBINATORICS, 2005, 21 (02) : 169 - 185
[3] Kennedy J., 1997, AUTSTRALASIAN J COMB, V16, P295
[4] Kennedy J., 1993, AUSTRALAS J COMB, V7, P101
[5] Kennedy J., 1994, AUSTRALAS J COMB, V10, P293
[6] Enumeration of labelled graphs with specified degree parities
Nara, C
Tazawa, S
[J]. DISCRETE MATHEMATICS, 1998, 183 (1-3) : 255 - 264
[7] PACKING AND COVERING OF COMPLETE GRAPH WITH 4-CYCLES
SCHONHEIM, J
BIALOSTOCKI, A
[J]. CANADIAN MATHEMATICAL BULLETIN-BULLETIN CANADIEN DE MATHEMATIQUES, 1975, 18 (05): : 703 - 708
[8] DECOMPOSITION OF KM,N (KM,N-STAR) INTO CYCLES (CIRCUITS) OF LENGTH 2K
SOTTEAU, D
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1981, 30 (01) : 75 - 81

← 1 →