Research Article

Chromatic Classes of 2-Connected (𝑛,𝑛+4)-Graphs with Exactly Three Triangles and at Least Two Induced 4-Cycles

Figure 2

Relative-closed family of 2-connected ( 𝑛 , 𝑛 + 4 ) -graphs with exactly 3 triangles. The light lines of the graphs refer to the paths with edges not belong to any triangles.
430396.fig.002