Work

Characterizing the forbidden pairs for graphs to be super-edge-connected

Year: 2024

Type: article

Abstract: Let H be a set of given connected graphs. A graph G is said to be H-free if G contains no H as an induced subgraph for any H∈H. The graph G is super-edge-connected if each minimum edge-cut isolates a vertex in G. In this paper, except for some special graphs, we characterize all forbidden subgraph sets H such that every H-free graph is super-edge-connected for |H|=1 and 2.

Source: AKCE International Journal of Graphs and Combinatorics

DOI: 10.1080/09728600.2024.2431965

Authors: Hazhe Ye, Yingzhi Tian

Institutions: Xinjiang Agricultural University, Xinjiang University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $1,226

Funder: National Natural Science Foundation of China