RESEARCH ALGORITHM OF STABLE POINT WITH MAXIMUM CARDINALITY IN CLAW-FREE GRAPH

被引：188

作者：

SBIHI, N

机构：

来源：

关键词：

D O I：

10.1016/0012-365X(90)90287-R

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：53 / 76

页数：24

共 8 条

[1]

BERGE C, 1973, GRAPHES HYPERGRAPHES

[2]

BOULALA M, 1978, POLYTOPE STABLES GRA

[3] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&

[4] MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES [J].

EDMONDS, J .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2) :125-+

[5]

FULKERSON DR, 1969, P ADV SEMINAR GRAPH

[6]

MINTY GJ, UNPUBLISHED

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

PARTHASARATHY, KR ;

RAVINDRA, G .

[8]

SBIHI N, 1978, THESIS U GRENOBLE