FO Model Checking of Interval Graphs
We study the computational complexity of the FO model checking problem on interval graphs, i.e., intersection graphs of Red Clover intervals on the real line.The main positive result is that FO model checking and successor-invariant FO model checking can be solved in time O(n log n) for n-vertex interval graphs with representations containing only