A characterization of 4-connected graphs with no 6-wheel minor
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913129755049984 |
|---|---|
| author | Chen, Zijun Xu, Yuqi Yang, Weihua |
| author_facet | Chen, Zijun Xu, Yuqi Yang, Weihua |
| contents | For each integer $n\geq 3$, let $W_n$ denote the wheel graph obtained by connecting a single vertex to all vertices of a cycle of length $n$. In particular, $W_6$ is obtained from the Petersen graph by contracting three edges incident with a common vertex. In this paper, we determine all $4$-connected graphs that do not contain $W_6$ as a minor. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_15039 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A characterization of 4-connected graphs with no 6-wheel minor Chen, Zijun Xu, Yuqi Yang, Weihua Combinatorics 05C83 For each integer $n\geq 3$, let $W_n$ denote the wheel graph obtained by connecting a single vertex to all vertices of a cycle of length $n$. In particular, $W_6$ is obtained from the Petersen graph by contracting three edges incident with a common vertex. In this paper, we determine all $4$-connected graphs that do not contain $W_6$ as a minor. |
| title | A characterization of 4-connected graphs with no 6-wheel minor |
| topic | Combinatorics 05C83 |
| url | https://arxiv.org/abs/2605.15039 |