ON UNAVOIDABLE DIGRAPHS IN ORIENTATIONS OF GRAPHS

被引：12
|
作者：
BLOOM, GS
BURR, SA
机构：
来源：
JOURNAL OF GRAPH THEORY | 1987年 / 11卷 / 04期
关键词：
D O I：
10.1002/jgt.3190110402
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
下载
收藏
页码：453 / 462
页数：10
相关论文
共 50 条
  • [1] Optimal Orientations of Graphs and Digraphs: A Survey
    K.M. Koh
    E.G. Tay
    Graphs and Combinatorics, 2002, 18 : 745 - 756
  • [2] Optimal orientations of graphs and digraphs: A survey
    Koh, KM
    Tay, EG
    GRAPHS AND COMBINATORICS, 2002, 18 (04) : 745 - 756
  • [3] Eternal dominating sets on digraphs and orientations of graphs
    Bagan, Guillaume
    Joffard, Alice
    Kheddouci, Hamamache
    DISCRETE APPLIED MATHEMATICS, 2021, 291 : 99 - 115
  • [4] Eternal dominating sets on digraphs and orientations of graphs
    Bagan, Guillaume
    Joffard, Alice
    Kheddouci, Hamamache
    Discrete Applied Mathematics, 2021, 291 : 99 - 115
  • [5] ON UNAVOIDABLE GRAPHS
    CHUNG, FRK
    ERDOS, P
    COMBINATORICA, 1983, 3 (02) : 167 - 176
  • [6] Universal and unavoidable graphs
    Bucic, Matija
    Dragani, Nemanja
    Sudakov, Benny
    COMBINATORICS PROBABILITY & COMPUTING, 2021, 30 (06): : 942 - 955
  • [7] Unavoidable subgraphs of colored graphs
    Cutler, Jonathan
    Montagh, Balazs
    DISCRETE MATHEMATICS, 2008, 308 (19) : 4396 - 4413
  • [8] Unavoidable cycle lengths in graphs
    Verstraete, J
    JOURNAL OF GRAPH THEORY, 2005, 49 (02) : 151 - 167
  • [9] COMPETITION GRAPHS AND RESOURCE GRAPHS OF DIGRAPHS
    WANG, C
    ARS COMBINATORIA, 1995, 40 : 3 - 48
  • [10] RANDOM GRAPHS + DIGRAPHS
    BHARGAVA, TN
    CHATTERJEE, SD
    ANNALS OF MATHEMATICAL STATISTICS, 1964, 35 (03): : 1399 - &
12345