Is there an algorithm for testing whethere a graph is K4-free?