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 条

[21] FERRERS DIGRAPHS AND THRESHOLD GRAPHS
COGIS, O
DISCRETE MATHEMATICS, 1982, 38 (01) : 33 - 46
[22] GRAPHS WITH UNAVOIDABLE SUBGRAPHS WITH LARGE DEGREES
CACCETTA, L
ERDOS, P
VIJAYAN, K
JOURNAL OF GRAPH THEORY, 1988, 12 (01) : 17 - 27
[23] Unavoidable minors of graphs of large type
Dittmann, J
Oporowski, B
DISCRETE MATHEMATICS, 2002, 248 (1-3) : 27 - 67
[24] UNAVOIDABLE STARS IN 3-GRAPHS
CHUNG, FRK
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1983, 35 (03) : 252 - 262
[25] Colored unavoidable patterns and balanceable graphs
Bowen, Matt
Hansberg, Adriana
Montejano, Amanda
Muyesser, Alp
ELECTRONIC JOURNAL OF COMBINATORICS, 2024, 31 (02):
[26] Unavoidable Configurations in Complete Topological Graphs
János Pach
József Solymosi
Géza Tóth
Discrete & Computational Geometry, 2003, 30 : 311 - 320
[27] The geodetic numbers of graphs and digraphs
Chang-hong LU~(1
2 Institute of Theoretical Computing
Science in China(Series A:Mathematics), 2007, (08) : 1163 - 1172
[28] Cycle packings in graphs and digraphs
Quinn, JJ
DISCRETE MATHEMATICS, 1996, 149 (1-3) : 325 - 328
[29] Cycle packings in graphs and digraphs
Quinn, J.J.
1996, (149): : 1 - 3
[30] THE CONNECTIVITY OF LARGE DIGRAPHS AND GRAPHS
FIOL, MA
JOURNAL OF GRAPH THEORY, 1993, 17 (01) : 31 - 45

← 1 2 3 4 5 →