The class of $(2P_3,C_4,C_6)$-free graphs, part I: $(2P_3,C_4,C_6)$-free graphs that contain an induced $C_7$ or an induced $T_0$
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915616728809472 |
|---|---|
| author | Penev, Irena |
| author_facet | Penev, Irena |
| contents | This is the first in a series of two papers dealing with $(2P_3,C_4,C_6)$-free graphs, or equivalently, $(2P_3,\text{even hole})$-free graphs. In this two-paper series, we give a full structural description of $(2P_3,C_4,C_6)$-free graphs that contain no simplicial vertices, and we show that such graphs have bounded clique-width. This implies that Graph Coloring can be solved in polynomial time for $(2P_3,C_4,C_6)$-free graphs. In this paper, we describe the structure of $(2P_3,C_4,C_6)$-free graphs that contain an induced $C_7$ or an induced $T_0$ (where $T_0$ is a certain 2-connected graph on nine vertices in which all holes are of length five), and we show that such graphs either contain a simplicial vertex or have bounded clique-width. In the second part of this series, we describe the structure of all $(2P_3,C_4,C_6,C_7,T_0)$-free graphs that contain no simplicial vertices, and we show that such graphs have bounded clique-width. The full statement of the theorem describing the structure of $(2P_3,C_4,C_6)$-free graphs that contain no simplicial vertices is given in the second paper of this series. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_10889 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The class of $(2P_3,C_4,C_6)$-free graphs, part I: $(2P_3,C_4,C_6)$-free graphs that contain an induced $C_7$ or an induced $T_0$ Penev, Irena Combinatorics This is the first in a series of two papers dealing with $(2P_3,C_4,C_6)$-free graphs, or equivalently, $(2P_3,\text{even hole})$-free graphs. In this two-paper series, we give a full structural description of $(2P_3,C_4,C_6)$-free graphs that contain no simplicial vertices, and we show that such graphs have bounded clique-width. This implies that Graph Coloring can be solved in polynomial time for $(2P_3,C_4,C_6)$-free graphs. In this paper, we describe the structure of $(2P_3,C_4,C_6)$-free graphs that contain an induced $C_7$ or an induced $T_0$ (where $T_0$ is a certain 2-connected graph on nine vertices in which all holes are of length five), and we show that such graphs either contain a simplicial vertex or have bounded clique-width. In the second part of this series, we describe the structure of all $(2P_3,C_4,C_6,C_7,T_0)$-free graphs that contain no simplicial vertices, and we show that such graphs have bounded clique-width. The full statement of the theorem describing the structure of $(2P_3,C_4,C_6)$-free graphs that contain no simplicial vertices is given in the second paper of this series. |
| title | The class of $(2P_3,C_4,C_6)$-free graphs, part I: $(2P_3,C_4,C_6)$-free graphs that contain an induced $C_7$ or an induced $T_0$ |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2511.10889 |