12 citations · 49 across the 20 of their papers we have counts for
Showing 2011 · math.COShow all
2 papers · 2 filters
math.CO2011
Making a graph crossing-critical by multiplying its edges
Laurent Beaudou, César Hernández-Vélez, Gelasio Salazar
A graph is crossing-critical if the removal of any of its edges decreases its crossing number. This work is motivated by the following question: to what extent is crossing- critica…
math.CO2011
Lines in hypergraphs
Laurent Beaudou, Adrian Bondy, Xiaomin Chen +5
One of the De Bruijn - Erdos theorems deals with finite hypergraphs where every two vertices belong to precisely one hyperedge. It asserts that, except in the perverse case where a…