@article{199931f94e384722b2a81377d5443a93,
title = "Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree",
abstract = "Let H be a class of given graphs. A graph G is said to be H-free if G contains no induced copies of H for any H ∈ H. In this article, we characterize all connected subgraph pairs {R, S} guranteeing the edge-connectivity of a connected {R, S}-free graph to have the same minimum degree. Our result is a supplement of Wang et al. Furthermore, we obtain a relationship of forbidden sets when those general parameters have the recurrence relation.",
keywords = "edge-connectivity, forbidden subgraph, minimum degree, parameter",
author = "Junfeng Du and Ziwen Huang and Liming Xiong",
note = "Publisher Copyright: {\textcopyright} 2022 by the authors. Licensee MDPI, Basel, Switzerland.",
year = "2022",
month = may,
doi = "10.3390/axioms11050219",
language = "English",
volume = "11",
journal = "Axioms",
issn = "2075-1680",
publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",
number = "5",
}