An extension of DHH-Erdős conjecture on cycle-plus-triangle graphs
The union of \(n\) triangles and the cycle on the \(3n\) vertices of the \(n\) triangles is called a cycle-plus-triangle graph. P. Erdős conjectured that every cycle-plus-triangle graph is \(3\)-colorable. This conjecture was proved by \textit{H. Fleischner} and \textit{M. Stiebitz} [Discrete Math. 101, 39-48 (1992; Zbl 0759.05037)]. In the present note the authors give an extension of the above conjecture with an application to switching networks.
scientific article; zbMATH DE number 1803275