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, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback