C. Picouleau

activity

20132026

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

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

collaborators

Showing 2013Show all

2 papers · 1 filter

math.CO2013★ 2 cited

Characterization of the degree sequences of (quasi) regular uniform hypergraphs

A. Frosini, C. Picouleau, S. Rinaldi

In hypergraph theory, determining a characterization of the degree sequence $d = (d_{1}, d_{2}, \dots, d_{n})$ where $d_{1} \geq d_{2} \geq \dots, d_{n}$ are positive integers, of an $h$ -uniform simple…

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 $O (n^{4})$ whether three given vertices of a graph belong to an induced tree. Here, we study four-in-a-tree fo…