The class of (P7,C4,C5)-free graphs: Decomposition, algorithms, and chi-boundedness

Cameron, K; Huang, SW; Penev, I; Sivaraman, V

Huang, SW (reprint author), Nankai Univ, Coll Comp Sci, Tianjin 300350, Peoples R China.

JOURNAL OF GRAPH THEORY, 0; ():

Abstract

As usual, Pn (n >= 1) denotes the path on n vertices, and Cn (n >= 3) denotes the cycle on n vertices. For a family H of graphs, we say that a g......

Full Text Link