Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree
Sign Up to like & getrecommendations! Published in 2022 at "Axioms"
DOI: 10.3390/axioms11050219
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… read more here.
Keywords: minimum degree; connectivity connected; edge connectivity; characterizing forbidden ... See more keywords