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 is a preview. Log in through your library . Abstract Given d ∊ (0, ∞) let $k_{d}$ be the smallest integer k such that d < 2k log k. We prove that the ...