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 ...
Graph colouring is a fundamental problem in both theoretical and applied combinatorics, with significant implications for computer science, operational research and network theory. At its essence, ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback