DOMINATING SUBGRAPHS IN GRAPHS WITH SOME FORBIDDEN STRUCTURES

被引：28

作者：

LIU, JP

ZHOU, HS

机构：

[1] SIMON FRASER UNIV,DEPT MATH & STAT,BURNABY,BC V5A 1S6,CANADA

[2] GEORGIA STATE UNIV,DEPT MATH & COMP SCI,ATLANTA,GA 30303

来源：

DISCRETE MATHEMATICS | 1994年 / 135卷 / 1-3期

关键词：

D O I：

10.1016/0012-365X(93)E0111-G

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We characterize the triangle-free graphs with neither induced path of six vertices nor induced cycle of six vertices and the triangle-free graphs without induced path of six vertices in terms of dominating subgraphs.

引用

页码：163 / 168

页数：6

共 8 条

[1] A CHARACTERIZATION OF GRAPHS WITHOUT LONG INDUCED PATHS [J].

BACSO, G ;

TUZA, Z .

JOURNAL OF GRAPH THEORY, 1990, 14 (04) :455-464

[2]

BACSO G, IN PRESS DOMINATING

[3]

Bacso G., 1990, PERIOD MATH HUNGAR, V21, P303, DOI DOI 10.1007/BF02352694

[4] THE MAXIMUM NUMBER OF EDGES IN 2K2-FREE GRAPHS OF BOUNDED DEGREE [J].

CHUNG, FRK ;

GYARFAS, A ;

TUZA, Z ;

TROTTER, WT .

DISCRETE MATHEMATICS, 1990, 81 (02) :129-135

[5] DOMINATING CLIQUES IN GRAPHS [J].

COZZENS, MB ;

KELLEHER, LL .

DISCRETE MATHEMATICS, 1990, 86 (1-3) :101-116

[6] ON THE EXISTENCE OF 2 NON-NEIGHBORING SUBGRAPHS IN A GRAPH [J].

ELZAHAR, M ;

ERDOS, P .

COMBINATORICA, 1985, 5 (04) :295-300

[7]

Sumner D.P., 1981, THEORY APPL GRAPHS, P557

[8]

WOLK ES, 1962, P AM MATH SOC, V3, P789

← 1 →