LONGEST PATHS AND CYCLES IN K1,3-FREE GRAPHS

被引：83

作者：

MATTHEWS, MM

SUMNER, DP

机构：

来源：

关键词：

D O I：

10.1002/jgt.3190090208

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：269 / 277

页数：9

共 9 条

[1] DOMINATION AND INDEPENDENT DOMINATION NUMBERS OF A GRAPH [J].

ALLAN, RB ;

LASKAR, R .

[2]

Behzad M., 1971, INTRO THEORY GRAPHS

[3]

DIRAC GA, 1952, P LOND MATH SOC, V2, P68

[4]

DUFFUS D, 1980, 4TH P INT C THEOR AP, P297

[5]

Goodman S., 1974, Journal of Combinatorial Theory, Series B, V16, P175, DOI 10.1016/0095-8956(74)90061-6

[6] HAMILTONIAN RESULTS IN K1,3 FREE GRAPHS [J].

MATTHEWS, MM ;

SUMNER, DP .

OBERLY, DJ ;

SUMNER, DP .

[8] STRONG PERFECT-GRAPH CONJECTURE IS TRUE FOR K1,3-FREE GRAPHS [J].

PARTHASARATHY, KR ;

RAVINDRA, G .

[9] GRAPHS WITH 1-FACTORS [J].

SUMNER, DP .