Derhy, Nicolas; Picouleau, Christophe; Trotignon, Nicolas - Centre d'Économie de la Sorbonne, Université Paris 1 … - 2008
The three-in-a-tree algorithm of Chudnovsky and Seymour decides in time O(n4) whether three given vertices of a graph … provide an O(nm)-time algorithm that given a triangle-free graph G together with four vertices outputs either an induced tree … belong to an induced tree. Here, we study four-in-a-tree for triangle-free graphs. We give a structural answer to the …