MAXIMUM INDUCED TREES IN GRAPHS

被引：77

|

作者：

ERDOS, P

SAKS, M

SOS, VT

机构：

[1] RUTGERS STATE UNIV,DEPT MATH,NEW BRUNSWICK,NJ 08903

[2] AT&T BELL LABS,MURRAY HILL,NJ 07974

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 1986年 / 41卷 / 01期

关键词：

D O I：

10.1016/0095-8956(86)90028-6

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

收藏

页码：61 / 79

页数：19

相关论文

共 50 条

[41] MAXIMAL INDUCED TREES IN SPARSE RANDOM GRAPHS
LUCZAK, T
PALKA, Z
DISCRETE MATHEMATICS, 1988, 72 (1-3) : 257 - 265
[42] Dominating and large induced trees in regular graphs
Rautenbach, Dieter
DISCRETE MATHEMATICS, 2007, 307 (24) : 3177 - 3186
[43] Induced trees in graphs of large chromatic number
Scott, AD
JOURNAL OF GRAPH THEORY, 1997, 24 (04) : 297 - 311
[44] ON INDUCED PATHS, HOLES, AND TREES IN RANDOM GRAPHS
Dutta, Kunal
Subramanian, C. R.
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (01) : 279 - 303
[45] Maximum Induced Linear Forests in Outerplanar Graphs
Michael J. Pelsmajer
Graphs and Combinatorics, 2004, 20 : 121 - 129
[46] INDUCED MATCHINGS IN GRAPHS OF BOUNDED MAXIMUM DEGREE
Joos, Felix
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2016, 30 (03) : 1876 - 1882
[47] Maximum induced linear forests in outerplanar graphs
Pelsmajer, MJ
GRAPHS AND COMBINATORICS, 2004, 20 (01) : 121 - 129
[48] Maximum Induced Forests in Graphs of Bounded Treewidth
Chappell, Glenn G.
Pelsmajer, Michael J.
ELECTRONIC JOURNAL OF COMBINATORICS, 2013, 20 (04):
[49] Maximum induced matchings of random cubic graphs
Duckworth, W
Wormald, NC
Zito, M
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2000, 1858 : 34 - 43
[50] Maximum induced matchings of random cubic graphs
Duckworth, W
Wormald, NC
Zito, M
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2002, 142 (01) : 39 - 50

← 1 2 3 4 5 →