Partial k-trees with maximum chromatic number

The paper is concerned with partial k-trees whose chromatic number is maximal, i.e. equal to (k+1). We have proved that any such graph contains a triangle (if k⩾3), but need not contain a clique on ⌊k+52⌋ vertices as a subgraph.