A survey on contractible edges in graphs of a prescribed vertex connectivity

被引：62
作者：
Kriesell, M [1 ]
机构：
[1] Univ Hannover, Inst Math A, D-30167 Hannover, Germany
来源：
GRAPHS AND COMBINATORICS | 2002年 / 18卷 / 01期
关键词：
D O I：
10.1007/s003730200000
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The aim of the present paper is to survey old and recent results on contractible edges in graphs of a given vertex connectivity.
引用
收藏
页码：1 / 30
页数：30
相关论文
共 58 条
[1]  
Aldred R. E. L., 1992, AUSTRALASIAN J COMBI, V6, P23
[2]   THE 3-CONNECTED GRAPHS HAVING A LONGEST CYCLE CONTAINING ONLY 3 CONTRACTILE EDGES [J].
ALDRED, REL ;
HEMMINGER, RL ;
OTA, K .
JOURNAL OF GRAPH THEORY, 1993, 17 (03) :361-371
[3]  
ALDRED REL, 1994, P 25 SE INT C COMB G
[4]  
ALDRED REL, 1995, AUST J COMB, V11, P3
[5]   A remark on the connectivity of the complement of a 3-connected graph [J].
Ando, K ;
Kaneko, A .
DISCRETE MATHEMATICS, 1996, 151 (1-3) :39-47
[6]   CONTRACTILE EDGES IN 3-CONNECTED GRAPHS [J].
ANDO, K ;
ENOMOTO, H ;
SAITO, A .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1987, 42 (01) :87-93
[7]  
ANDO K, SOME FORBIDDEN SUBGR
[8]  
ANDO K, CONTRACTIBLE EDGES M
[9]  
ANDO K, VERTICES DEGREE 5 5
[10]   Contractible circuits in 3-connected graphs [J].
Barnette, DW .
DISCRETE MATHEMATICS, 1998, 187 (1-3) :19-29
123456