PACKING THREE-VERTEX PATHS IN 2-CONNECTED CUBIC GRAPHS

被引：0

作者：

Kosowski, Adrian ^{[1
]}

Zylinski, Pawel ^{[2
]}

机构：

[1] Gdansk Univ Technol, Dept Algorithms & Syst Modeling, PL-80952 Gdansk, Poland

[2] Gdansk Univ Technol, Inst Comp Sci, PL-80952 Gdansk, Poland

来源：

ARS COMBINATORIA | 2008年 / 89卷

关键词：

Three-vertex paths; factor packing; cubic graph;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We show that every 2-connected cubic graph of order n > 8 admits a P-3-packing of at least [9n/11] vertices. The proof is constructive, implying an O(M(n)) time algorithm for constructing such a packing, where M(n) is the time complexity of the perfect matching problem for 2-connected cubic graphs.

引用

页码：95 / 113

页数：19

共 50 条

[31] ROMAN DOMINATION ON 2-CONNECTED GRAPHS
Liu, Chun-Hung
Chang, Gerard J.
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (01) : 193 - 205
[32] THE LONGEST CYCLE IN 2-CONNECTED GRAPHS
CHEN, GT
WEI, B
WU, HD
[J]. KEXUE TONGBAO, 1987, 32 (21): : 1507 - 1507
[33] On the circumferences of regular 2-connected graphs
Bing, W
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1999, 75 (01) : 88 - 99
[34] Traceability on 2-connected line graphs
Tian, Tao
Xiong, Liming
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2018, 321 : 463 - 471
[35] 2-connected and 2-edge-connected Steinhaus graphs
Kim, D
Lim, D
[J]. DISCRETE MATHEMATICS, 2002, 256 (1-2) : 257 - 265
[36] Note on dominating cycles in 2-connected graphs
[J]. Discrete Math, 1-3 (13):
[37] HAMILTON CYCLES IN REGULAR 2-CONNECTED GRAPHS
JACKSON, B
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1980, 29 (01) : 27 - 46
[38] On minimally 2-connected graphs with generalized connectivity
Li, Shasha
Li, Wei
Shi, Yongtang
Sun, Haina
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (01) : 141 - 164
[39] Entire coloring of 2-connected plane graphs
Wang, Weifan
Hu, Xiaoxue
Wang, Yiqiao
[J]. EUROPEAN JOURNAL OF COMBINATORICS, 2021, 94
[40] 2-Connected spanning subgraphs of circuit graphs
Nakamoto, Atsuhiro
Ozeki, Kenta
Takahashi, Daiki
[J]. DISCRETE MATHEMATICS, 2025, 348 (01)

← 1 2 3 4 5 →