Title of article
Partial k-trees with maximum chromatic number
Author/Authors
Janka Chleb??kov?، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
8
From page
269
To page
276
Abstract
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.
Keywords
Treewidth , Chromatic number , Clique number , Partial k-tree
Journal title
Discrete Mathematics
Serial Year
2002
Journal title
Discrete Mathematics
Record number
949413
Link To Document