INTERVAL COMPETITION GRAPHS OF SYMMETRICAL DIGRAPHS

被引：13

作者：

LUNDGREN, JR ^{[1
]}

RASMUSSEN, CW ^{[1
]}

MAYBEE, JS ^{[1
]}

机构：

[1] UNIV COLORADO, BOULDER, CO 80309 USA

来源：

DISCRETE MATHEMATICS | 1993年 / 119卷 / 1-3期

关键词：

D O I：

10.1016/0012-365X(93)90121-9

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The competition graph of a loopless symmetric digraph H is the two-step qraph, S2(H). Necessary and sufficient conditions on H are given for S2(H) to be interval or unit interval. These are useful properties when application requires that the competition graph be efficiently colorable. Computational aspects are discussed, as are related open problems.

引用

页码：113 / 122

页数：10

共 50 条

[21] Cayley digraphs and graphs
Delorme, Charles
[J]. EUROPEAN JOURNAL OF COMBINATORICS, 2013, 34 (08) : 1307 - 1315
[22] Note on p-Competition Graphs of Loopless Hamiltonian Digraphs Without Symmetric Arcs
Kidokoro, Y.
Ogawa, K.
Tagusari, S.
Tsuchiya, M.
[J]. SOUTHEAST ASIAN BULLETIN OF MATHEMATICS, 2019, 43 (06) : 827 - 831
[23] ALGORITHMS FOR INTERVAL CATCH DIGRAPHS
PRISNER, E
[J]. DISCRETE APPLIED MATHEMATICS, 1994, 51 (1-2) : 147 - 157
[24] Short proofs for interval digraphs
West, DB
[J]. DISCRETE MATHEMATICS, 1998, 178 (1-3) : 287 - 292
[25] Chronological orderings of interval digraphs
Sen, Malay
Talukdar, P.
Das, Sandip
[J]. DISCRETE MATHEMATICS, 2006, 306 (14) : 1601 - 1609
[26] A CHARACTERIZATION OF INTERVAL CATCH DIGRAPHS
PRISNER, E
[J]. DISCRETE MATHEMATICS, 1989, 73 (03) : 285 - 289
[27] EDGE EXTENSION OF GRAPHS AND DIGRAPHS
Attar, Akram B.
[J]. JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE-JMCS, 2011, 3 (01): : 1 - 10
[28] Superconnectivity of bipartite digraphs and graphs
Balbuena, C
Carmona, A
Fàbrega, J
Fiol, MA
[J]. DISCRETE MATHEMATICS, 1999, 197 (1-3) : 61 - 75
[29] FERRERS DIGRAPHS AND THRESHOLD GRAPHS
COGIS, O
[J]. DISCRETE MATHEMATICS, 1982, 38 (01) : 33 - 46
[30] Cycle packings in graphs and digraphs
Quinn, JJ
[J]. DISCRETE MATHEMATICS, 1996, 149 (1-3) : 325 - 328

← 1 2 3 4 5 →