24 citations · 100 across the 34 of their papers we have counts for
4 papers · 2 filters
On wheel-free graphs
Pierre Aboulker, Frédéric Havet, Nicolas Trotignon
A wheel is a graph formed by a chordless cycle and a vertex that has at least three neighbors in the cycle. We prove that every 3-connected graph that does not contain a wheel as a…
Linear balanceable and subcubic balanceable graphs
Pierre Aboulker, Marko Radovanović, Nicolas Trotignon +2
In [{Structural properties and decomposition of linear balanced matrices}, {\it Mathematical Programming}, 55:129--168, 1992], Conforti and Rao conjectured that every balanced bipa…
Wheel-free planar graphs
Pierre Aboulker, Maria Chudnovsky, Paul Seymour +1
A \emph{wheel} is a graph formed by a chordless cycle and a vertex not in that has at least three neighbors in . We prove that every 3-connected planar graph that do…
Number of lines in hypergraphs
Pierre Aboulker, Adrian Bondy, Xiaomin Chen +3
Chen and Chvátal introduced the notion of lines in hypergraphs; they proved that every 3-uniform hypergraph with vertices either has a line that consists of all vertices or…