Geometric intersection graphs form an intriguing class of structures in which vertices represent geometric objects – such as line segments, discs, or curves – and an edge is established between two ...

We derive a formula for the chromatic polynomial of a chordal or a triangulated graph in terms of its maximal cliques. As a corollary we obtain a way to write down an explicit formula for the ...

This paper proves that for any integer n ≥ 4 and any rational number r, 2 ≤ r ≤ n — 2, there exists a graph G which has circular chromatic number r and which does not contain Kn as a minor. Journal ...