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+5 2 ⌋ vertices as a subgraph.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call