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$

TL;DR

This paper characterizes a class of graphs free of certain induced subgraphs, showing that those containing specific structures either have a simplicial vertex or bounded clique-width, enabling polynomial-time graph coloring.

Contribution

It provides a structural description of $(2P_3,C_4,C_6)$-free graphs with induced $C_7$ or $T_0$, and proves they either contain a simplicial vertex or have bounded clique-width.

Findings

Graphs with induced $C_7$ or $T_0$ either contain a simplicial vertex or have bounded clique-width.

Bounded clique-width implies polynomial-time solvability for Graph Coloring.

Structural characterization aids in understanding the complexity of these graph classes.

Abstract

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.