The structure of minimally 2-subconnected graphs
A graph G with at least 2k vertices is called k-subconnected if, for any 2k vertices in G, there are k independent paths P1,P2,⋯,Pk joining the 2k vertices in pairs. A graph G is minimally 2-subconnected if G is 2-subconnected and G−e is not 2-subconnected for any edge e in G. The concept of k-subco...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2022-03-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2022550?viewType=HTML |