On cyclically 4-connected cubic graphs
AbstractA 3-connected cubic graph is cyclically 4-connected if it has at least [Formula: see text] vertices and when removal of a set of three edges results in a disconnected graph, only one component has cycles. By introducing the notion of cycle spread to quantify the distance between pairs of edg...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2024-04-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2024.2333397 |