Daniel Lokshtanov’s work explores the limits of what computers can solve, paving the way for advances in artificial intelligence and computational efficiency.
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 ...
Abstract. Let 𝐼(𝐺;𝑥) denote the independence polynomial of a graph 𝐺. In this paper we study the unimodality properties of 𝐼(𝐺;𝑥) for some composite graphs 𝐺. Given two graphs 𝐺₁ and 𝐺₂, let ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback