SEPARATION OF GRAPHS INTO 3 COMPONENTS BY THE REMOVAL OF EDGES

被引：4

|

作者：

GOLDSMITH, DL

MANVEL, B

FABER, V

机构：

[1] UNIV COLORADO, BOULDER, CO 80309 USA

[2] COLORADO STATE UNIV, FT COLLINS, CO 80521 USA

来源：

JOURNAL OF GRAPH THEORY | 1980年 / 4卷 / 02期

关键词：

D O I：

10.1002/jgt.3190040209

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

收藏

页码：213 / 218

页数：6

相关论文

共 50 条

[21] On Non-Essential Edges in 3-Connected Graphs
Talmage James Reid
Haidong Wu
Graphs and Combinatorics, 2000, 16 : 337 - 354
[22] An Extremal Problem on Contractible Edges in 3-Connected Graphs
Joe Anderson
Haidong Wu
Graphs and Combinatorics, 2006, 22 : 145 - 152
[23] Contractible and Removable Edges in 3-Connected Infinite Graphs
Tsz Lung Chan
Graphs and Combinatorics, 2015, 31 : 871 - 883
[24] Contractible non-edges in 3-connected graphs
Kriesell, M
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1998, 74 (02) : 192 - 201
[25] Contractible and Removable Edges in 3-Connected Infinite Graphs
Chan, Tsz Lung
GRAPHS AND COMBINATORICS, 2015, 31 (04) : 871 - 883
[26] Contractible edges in 3-connected graphs that preserve a minor
Costalonga, Joao Paulo
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2020, 140 : 1 - 26
[27] Contractible Edges in Spanning Trees of 3-Connected Graphs
Qin, Chengfu
Geng, Jin
Yang, Hailing
Xie, Xiaoqing
GRAPHS AND COMBINATORICS, 2025, 41 (01)
[28] An extremal problem on contractible edges in 3-connected graphs
Anderson, J
Wu, HD
GRAPHS AND COMBINATORICS, 2006, 22 (02) : 145 - 152
[29] Contractible Edges and Longest Cycles in 3-Connected Graphs
Egawa, Yoshimi
Nakamura, Shunsuke
GRAPHS AND COMBINATORICS, 2023, 39 (01)
[30] LONGEST CYCLES IN 3-CONNECTED GRAPHS CONTAIN 3 CONTRACTIBLE EDGES
DEAN, N
HEMMINGER, RL
OTA, K
JOURNAL OF GRAPH THEORY, 1989, 13 (01) : 17 - 21

← 1 2 3 4 5 →