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+5)/2⌋ vertices as a subgraph.
|Early online date||4 Sep 2002|
|Publication status||Published - 2002|
- Partial k-tree
- Chromatic number
- Clique number