Discussion
nobody told me perfect graphs are fucking sick as hell?????? https://en.wikipedia.org/wiki/Perfect_graph
For instance, in all perfect graphs, the graph coloring problem, maximum clique problem, and maximum independent set problem can all be solved in polynomial time, despite their greater complexity for non-perfect graphs.
RECOGNIZABLE in poly time too????? MODS!!!
oh oops i misread https://en.wikipedia.org/wiki/Comparability_graph
Cocomparability graphs form an important subclass of perfect graphs
it's cocomparability that are perfect. no wonder
OH NOPE WE ARE SO BACK
Every comparability graph is perfect.
OH EVERY COMPLEMENT OF A PERFECT GRAPH IS PERFECT https://en.wikipedia.org/wiki/Perfect_graph_theorem
Install bonfire.cafe
Get the full app experience
