Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree

Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree

Let <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi mathvariant="script">H</mi></semantics></math></inline-formula> be a class of given graphs. A graph <i>G</i>...

Full description

Bibliographic Details
Main Authors: Junfeng Du, Ziwen Huang, Liming Xiong
Format: Article
Language:English
Published: MDPI AG 2022-05-01
Series:Axioms
Subjects:
forbidden subgraph
edge-connectivity
minimum degree
parameter
Online Access:https://www.mdpi.com/2075-1680/11/5/219

Internet

https://www.mdpi.com/2075-1680/11/5/219

Similar Items