THE STRUCTION OF A GRAPH - APPLICATION TO CN-FREE GRAPHS

被引：28

作者：

HAMMER, PL

MAHADEV, NVR

DEWERRA, D

机构：

[1] RUTGERS STATE UNIV,NEW BRUNSWICK,NJ 08903

[2] UNIV WATERLOO,DEPT COMBINAT & OPTIMIZAT,WATERLOO N2L 3G1,ONTARIO,CANADA

[3] UNIV WINNIPEG,DEPT MATH,WINNIPEG R3B 2E9,MANITOBA,CANADA

[4] ECOLE POLYTECH FED LAUSANNE,DEPT MATH,CH-1015 LAUSANNE,SWITZERLAND

来源：

关键词：

D O I：

10.1007/BF02579377

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：141 / 147

页数：7

共 6 条

[1]

EBENEGGER C, 1984, ANN DISCRETE MATH, V19, P83, DOI [10.1016/S0304-0208(08)72955-4, DOI 10.1016/S0304-0208(08)72955-4]

[2]

Golumbic M. C., 1980, ALGORITHMIC GRAPH TH

[3]

Gould R., 1981, THEORY APPL GRAPHS, P297

[4] STABILITY IN CAN-FREE GRAPHS [J].

HAMMER, PL ;

MAHADEV, NVR ;

DEWERRA, D .

[5] ON MAXIMAL INDEPENDENT SETS OF VERTICES IN CLAW-FREE GRAPHS [J].

MINTY, GJ .

SBIHI, N .