@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",
}