Forbidden Pairs for Equality of Connectivity and Edge-Connectivity of Graphs

Shipeng Wang; Shoichi Tsuchiya; Liming Xiong

doi:10.1007/s00373-018-2003-8

Forbidden Pairs for Equality of Connectivity and Edge-Connectivity of Graphs

Shipeng Wang
, Shoichi Tsuchiya
, Liming Xiong^*

^*此作品的通讯作者

数学学院

Beijing Institute of Technology
Senshu University

科研成果: 期刊稿件 › 文章 › 同行评审

2 引用（Scopus）

摘要

Let H be a set of connected graphs. A graph is said to be H-free if it does not contain any member of H as an induced subgraph. In this paper, we characterize all pairs R, S such that every connected { R, S} -free graph has the same (vertex)-connectivity and edge-connectivity.

源语言	英语
页（从-至）	419-426
页数	8
期刊	Graphs and Combinatorics
卷	35
期	2
DOI	https://doi.org/10.1007/s00373-018-2003-8
出版状态	已出版 - 15 3月 2019

访问文件

10.1007/s00373-018-2003-8

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{df256d184cff4da5aa5021c50d6009a8,

title = "Forbidden Pairs for Equality of Connectivity and Edge-Connectivity of Graphs",

abstract = "Let H be a set of connected graphs. A graph is said to be H-free if it does not contain any member of H as an induced subgraph. In this paper, we characterize all pairs R, S such that every connected \{ R, S\} -free graph has the same (vertex)-connectivity and edge-connectivity.",

keywords = "Connectivity, Edge connectivity, Forbidden subgraph",

author = "Shipeng Wang and Shoichi Tsuchiya and Liming Xiong",

note = "Publisher Copyright: {\textcopyright} 2019, Springer Japan KK, part of Springer Nature.",

year = "2019",

month = mar,

day = "15",

doi = "10.1007/s00373-018-2003-8",

language = "English",

volume = "35",

pages = "419--426",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "2",

}

TY - JOUR

T1 - Forbidden Pairs for Equality of Connectivity and Edge-Connectivity of Graphs

AU - Wang, Shipeng

AU - Tsuchiya, Shoichi

AU - Xiong, Liming

PY - 2019/3/15

Y1 - 2019/3/15

N2 - Let H be a set of connected graphs. A graph is said to be H-free if it does not contain any member of H as an induced subgraph. In this paper, we characterize all pairs R, S such that every connected { R, S} -free graph has the same (vertex)-connectivity and edge-connectivity.

AB - Let H be a set of connected graphs. A graph is said to be H-free if it does not contain any member of H as an induced subgraph. In this paper, we characterize all pairs R, S such that every connected { R, S} -free graph has the same (vertex)-connectivity and edge-connectivity.

KW - Connectivity

KW - Edge connectivity

KW - Forbidden subgraph

UR - https://www.scopus.com/pages/publications/85059515526

U2 - 10.1007/s00373-018-2003-8

DO - 10.1007/s00373-018-2003-8

M3 - Article

AN - SCOPUS:85059515526

SN - 0911-0119

VL - 35

SP - 419

EP - 426

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 2

ER -

Forbidden Pairs for Equality of Connectivity and Edge-Connectivity of Graphs

摘要

访问文件

其它文件与链接

学术指纹

引用此