most citedThe four-in-a-tree problem in triangle-free graphs

11 citations · 11 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DM2013★ 11 cited

The four-in-a-tree problem in triangle-free graphs

Nicolas Derhy, Christophe Picouleau, Nicolas Trotignon

The three-in-a-tree algorithm of Chudnovsky and Seymour decides in time whether three given vertices of a graph belong to an induced tree. Here, we study four-in-a-tree fo…