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^*

^*Corresponding author for this work

School of Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

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.

Original language	English
Pages (from-to)	419-426
Number of pages	8
Journal	Graphs and Combinatorics
Volume	35
Issue number	2
DOIs	https://doi.org/10.1007/s00373-018-2003-8
Publication status	Published - 15 Mar 2019

Keywords

Connectivity
Edge connectivity
Forbidden subgraph

Access to Document

10.1007/s00373-018-2003-8

Cite this

@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 - http://www.scopus.com/inward/record.url?scp=85059515526&partnerID=8YFLogxK

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this