NUMBER OF 1-FACTORS IN 2-CONNECTED GRAPHS

被引：0

|

作者：

MADER, W ^{[1
]}

机构：

[1] FREE UNIV BERLIN,MATH INST 2,D-1000 BERLIN 33,FED REP GER

来源：

MATHEMATISCHE NACHRICHTEN | 1976年 / 74卷

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

收藏

页码：217 / 232

页数：16

相关论文

共 50 条

[1] NUMBER OF 1-FACTORS IN 2K-CONNECTED GRAPHS
BOLLOBAS, B
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1978, 25 (03) : 363 - 366
[2] ON 1-FACTORS OF N-CONNECTED GRAPHS
ZAKS, JY
[J]. NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1969, 16 (04): : 649 - &
[3] The rainbow connection number of 2-connected graphs
Ekstein, Jan
Holub, Premysl
Kaiser, Tomas
Koch, Maria
Camacho, Stephan Matos
Ryjacek, Zdenek
Schiermeyer, Ingo
[J]. DISCRETE MATHEMATICS, 2013, 313 (19) : 1884 - 1892
[4] Graphs with the maximum or minimum number of 1-factors
Gross, D.
Kahl, N.
Saccoman, J. T.
[J]. DISCRETE MATHEMATICS, 2010, 310 (04) : 687 - 691
[5] ON THE NUMBER OF 1-FACTORS OF LOCALLY FINITE GRAPHS
BRY, F
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1983, 34 (01) : 48 - 57
[6] On the size and structure of graphs with a constant number of 1-factors
Dudek, Andrzej
Schmitt, John R.
[J]. DISCRETE MATHEMATICS, 2012, 312 (10) : 1807 - 1811
[7] EDGE-DISJOINT 1-FACTORS IN POWERS OF CONNECTED GRAPHS
NEBESKY, L
[J]. CZECHOSLOVAK MATHEMATICAL JOURNAL, 1984, 34 (04) : 499 - 505
[8] ON THE EDGE-DISJOINT 1-FACTORS IN THE POWER OF CONNECTED GRAPHS
张建勋
[J]. Science Bulletin, 1990, (21) : 1841 - 1841
[9] 2-connected graphs with small 2-connected dominating sets
Caro, Y
Yuster, R
[J]. DISCRETE MATHEMATICS, 2003, 269 (1-3) : 265 - 271
[10] ON THE EDGE-DISJOINT 1-FACTORS IN THE POWER OF CONNECTED GRAPHS
ZHANG, JX
[J]. CHINESE SCIENCE BULLETIN, 1990, 35 (21): : 1841 - 1841

← 1 2 3 4 5 →