EDGE AND VERTEX INTERSECTION OF PATHS IN A TREE

被引：53

作者：

GOLUMBIC, MC ^{[1
]}

JAMISON, RE ^{[1
]}

机构：

[1] CLEMSON UNIV,DEPT MATH,CLEMSON,SC 29631

来源：

关键词：

D O I：

10.1016/0012-365X(85)90043-3

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：151 / 159

页数：9

共 11 条

[1]

Berge C., 1973, GRAPHS HYPERGRAPHS, V7

[2]

GAVRIL F, 1978, DISCRETE MATH, V23, P211, DOI 10.1016/0012-365X(78)90003-1

[3]

Golumbic M. C., 1980, ALGORITHMIC GRAPH TH

[4]

GOLUMBIC MC, 1985, J COMBIN THEORY B, V37

[5]

LOBB WA, 1982, 11TH S MATH PROGR BO

[6] INTERSECTION REPRESENTATIONS OF GRAPHS BY ARCS [J].

RENZ, PL .

[7] A THEOREM ON COLORING THE LINES OF A NETWORK [J].

SHANNON, CE .

JOURNAL OF MATHEMATICS AND PHYSICS, 1949, 28 (02) :148-151

[8] TRIANGULATED EDGE INTERSECTION GRAPHS OF PATHS IN A TREE [J].

SYSLO, MM .

[9]

SYSLO MM, 1978, PROBLEMES COMBINATOI, P395

[10]

SYSLO MM, 1978, N40 U WROCL I COMP S