Another application of perfect elimination orderings is finding a maximum clique of a chordal graph in polynomial-time, while the same problem for general graphs is NP-complete.
The chromatic polynomial of a chordal graph is easy to compute.