The k-subconnectedness of planar graphs
A graph G with at least 2k vertices is called k-subconnected if, for any 2k vertices x1,x2,⋯,x2k in G, there are k independent paths joining the 2k vertices in pairs in G. In this paper, we prove that a k-connected planar graph with at least 2k vertices is k-subconnected for k=1,2; a 4-connected pla...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2021-03-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | http://www.aimspress.com/article/doi/10.3934/math.2021340?viewType=HTML |