LARGEST BIPARTITE SUBGRAPHS IN TRIANGLE-FREE GRAPHS WITH MAXIMUM DEGREE 3

被引：49

作者：

BONDY, JA ^{[1
]}

LOCKE, SC ^{[1
]}

机构：

[1] FLORIDA ATLANTIC UNIV, BOCA RATON, FL 33431 USA

来源：

关键词：

D O I：

10.1002/jgt.3190100407

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：477 / 504

页数：28

共 21 条

[1]

BONDY JA, 1976, GRAPH THEORY APPLICA

[2] On colouring the nodes of a network [J].

Brooks, RL .

PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1941, 37 :194-197

[3]

EDWARDS CS, 1973, CAN J MATH, V25, P475, DOI 10.4153/CJM-1973-048-x

[4] ON SOME EXTREMAL PROBLEMS IN GRAPH THEORY [J].

ERDOS, P .

[5]

Erdos P., 1967, MATH LAPOK, V18, P283

[6]

Erdos P., 1979, GRAPH THEORY RELATED, P153

[7]

EVEN S, 1975, 43 TECHN DEP COMP SC

[8]

Garey M. R., 1976, Theoretical Computer Science, V1, P237, DOI 10.1016/0304-3975(76)90059-1

[9]

Grotschel M., 1981, Operations Research Letters, V1, P23, DOI 10.1016/0167-6377(81)90020-1

[10]

Hadlock F., 1975, SIAM Journal on Computing, V4, P221, DOI 10.1137/0204019