ON MAXIMAL INDEPENDENT SETS OF VERTICES IN CLAW-FREE GRAPHS

被引:295
作者
MINTY, GJ
机构
关键词
D O I
10.1016/0095-8956(80)90074-X
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:284 / 304
页数:21
相关论文
共 15 条
[1]  
BEINEKE LW, 1969, MANY FACES GRAPH THE, P45
[3]  
Berge C., 1973, GRAPHS HYPERGRAPHS
[5]  
Busacker R.G., 1965, FINITE GRAPHS NETWOR
[6]  
Charnes A., 1953, INTRO LINEAR PROGRAM
[7]   PATHS TREES AND FLOWERS [J].
EDMONDS, J .
CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&
[8]   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-+
[9]  
EDMONDS J, OPTIMUM MATCHINGS
[10]   CHARACTERIZATION OF COMPARABILITY GRAPHS + OF INTERVAL GRAPHS [J].
GILMORE, PC ;
HOFFMAN, AJ .
CANADIAN JOURNAL OF MATHEMATICS, 1964, 16 (03) :539-&