Report copyright - Introduction to Triangulated Graphstandy.cs.illinois.edu/581-2018-chordal.pdf · • Every chordal graph has at most n maximal cliques, and these can be found in polynomial time:
Please pass captcha verification before submit form
Please pass captcha verification before submit form