On 3-colorability of (claw, diamond)-free graphs

TL;DR

This paper investigates the 3-colorability of certain (claw, diamond)-free graphs extended with generalized net structures, establishing conditions under which these graphs are 3-colorable or contain a K4, and analyzing the finiteness of non-3-colorable cases.

Contribution

It characterizes 3-colorability in (claw, diamond, N_{i,j,k})-free graphs for specific parameters, identifying finite and infinite classes of non-3-colorable graphs.

Findings

Graphs with certain (i,j,k) are either 3-colorable or contain a K4.

Finitely many non-3-colorable graphs for N_{1,2,k}-free with k≥2.

Infinitely many non-3-colorable graphs for other N_{i,j,k} configurations.

Abstract

The $3$-colorability problem is a well-known NP-complete problem and it remains NP-complete for $(claw, diamond, K_4)$-free graphs. Recently, $3$-colorability has been also considered for $(claw, N_{1,1,1})$-free graphs. Here, a generalised net $N_{i, j, k}$ is the graph obtained by identifying each vertex of a triangle with an endvertex of one of three vetex-disjont paths of lengths $i, j, k$. We study the class of $(claw, diamond, N_{i, j, k})$-free graphs for $(i, j, k) \in \{(1, 1, 3),$ $ (1, 2, 2), $ $(2, 2, 2) \}$. We show that these graphs are $3$-colorable or contain a $K_4$ or belong to some well-defined class of non $3$-colorable graphs. Moreover, we prove that there are only finitely many non $3$-colorable $N_{1, 2, k}$-free graphs for any $k \geq 2$, but there exist infinitely many non $3$-colorable $N_{i, j, k}$-free graphs for any $2 \leq i \leq j \leq k.$