A CHARACTERIZATION OF INTERVAL CATCH DIGRAPHS

被引：15

|

作者：

PRISNER, E

机构：

来源：

DISCRETE MATHEMATICS | 1989年 / 73卷 / 03期

关键词：

D O I：

10.1016/0012-365X(89)90271-9

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

收藏

页码：285 / 289

页数：5

相关论文

共 50 条

[41] An Investigation of New Graph Invariants Related to the Domination Number of Random Proximity Catch Digraphs
Elvan Ceyhan
Methodology and Computing in Applied Probability, 2012, 14 : 299 - 334
[42] An Investigation of New Graph Invariants Related to the Domination Number of Random Proximity Catch Digraphs
Ceyhan, Elvan
METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY, 2012, 14 (02) : 299 - 334
[43] A Characterization of Locally Semicomplete CKI-digraphs
Hortensia Galeana-Sánchez
Mika Olsen
Graphs and Combinatorics, 2016, 32 : 1873 - 1879
[44] Characterization of self-complementary symmetric digraphs
Zhang, H
DISCRETE MATHEMATICS, 1996, 161 (1-3) : 323 - 327
[45] A characterization problem on underlying graphs of line digraphs
El Sahili, A
DISCRETE APPLIED MATHEMATICS, 2005, 146 (01) : 99 - 101
[46] Characterization of graphs and digraphs with small process numbers
Coudert, David
Sereni, Jean-Sebastien
DISCRETE APPLIED MATHEMATICS, 2011, 159 (11) : 1094 - 1109
[47] The constructive characterization of (κ,ℓ)-edge-connected digraphs
Erika R. Kovács
László A. Végh
Combinatorica, 2011, 31 : 201 - 223
[48] The constructive characterization of (κ,a"")-edge-connected digraphs
Kovacs, Erika R.
Vegh, Laszlo A.
COMBINATORICA, 2011, 31 (02) : 201 - 223
[49] A characterization of Markov equivalence classes for acyclic digraphs
Andersson, SA
Madigan, D
Perlman, MD
ANNALS OF STATISTICS, 1997, 25 (02): : 505 - 541
[50] CHARACTERIZATION OF NORMAL DIGRAPHS WITH 6 AND 7 VERTICES
MIRKO, L
GRAPH THEORY, 1989, : 90 - 98

← 1 2 3 4 5 →