Laurent Beaudou

activity

20082026

most citedBounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension

12 citations · 49 across the 20 of their papers we have counts for

collaborators

Showing 2018 · math.COShow all

3 papers · 2 filters

math.CO2018★ 3 cited

Homomorphism bounds of signed bipartite $K_{4}$ -minor-free graphs and edge-colorings of $2 k$ -regular $K_{4}$ -minor-free multigraphs

Laurent Beaudou, Florent Foucaud, Reza Naserasr

A signed graph $(G, Σ)$ is a graph $G$ and a subset $Σ$ of its edges which corresponds to an assignment of signs to the edges: edges in $Σ$ are negative while edges not in $Σ$ are…

math.CO2018

Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs

Alexandre Bazin, Laurent Beaudou, Giacomo Kahn +1

We bound the number of minimal hypergraph transversals that arise in tri-partite 3-uniform hypergraphs, a class commonly found in applications dealing with data. Let H be such a hy…

math.CO2018★ 4 cited

Broadcast domination and multipacking: bounds and the integrality gap

Laurent Beaudou, Richard C. Brewster, Florent Foucaud

The dual concepts of coverings and packings are well studied in graph theory. Coverings of graphs with balls of radius one and packings of vertices with pairwise distances at least…

Homomorphism bounds of signed bipartite K4​-minor-free graphs and edge-colorings of 2k-regular K4​-minor-free multigraphs

Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs

Broadcast domination and multipacking: bounds and the integrality gap

Homomorphism bounds of signed bipartite $K_{4}$ -minor-free graphs and edge-colorings of $2 k$ -regular $K_{4}$ -minor-free multigraphs