#### Filter Results:

- Full text PDF available (17)

#### Publication Year

2007

2017

- This year (2)
- Last 5 years (12)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Laurent Beaudou, Sylvain Gravier, Kahina Meslem
- SIAM J. Discrete Math.
- 2007

- Laurent Beaudou, Sylvain Gravier, Sandi Klavzar, Matjaz Kovse, Michel Mollard
- Discrete Mathematics & Theoretical Computer…
- 2010

For a graph G and integers a and b, an (a, b)-code of G is a set C of vertices such that any vertex from C has exactly a neighbors in C and any vertex not in C has exactly b neighbors in C. In this paper we classify integers a and b for which there exists (a, b)-codes in Sierpiński graphs.

- Laurent Beaudou, Arnaud Mary, Lhouari Nourine
- Theor. Comput. Sci.
- 2017

Article history: Received 1 April 2015 Received in revised form 12 October 2015 Accepted 22 October 2015 Available online xxxx

- Laurent Beaudou, John Adrian Bondy, +5 authors Yori Zwols
- Electr. J. Comb.
- 2015

A special case of a combinatorial theorem of De Bruijn and Erdős asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvátal suggested a possible generalization of this assertion in metric spaces with appropriately defined lines. We prove this generalization in all metric spaces induced by connected… (More)

- Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy
- ArXiv
- 2013

Given a directed graph D = (V,A) we define its intersection graph I(D) = (A,E) to be the graph having A as a node-set and two nodes of I(D) are adjacent if their corresponding arcs share a common node that is the tail of at least one of these arcs. We call these graphs facility location graphs since they arise from the classical uncapacitated facility… (More)

- Laurent Beaudou, John Adrian Bondy, +5 authors Yori Zwols
- Combinatorica
- 2013

One of the De Bruijn Erdős theorems deals with finite hypergraphs where every two vertices belong to precisely one hyperedge. It asserts that, except in the perverse case where a single hyperedge equals the whole vertex set, the number of hyperedges is at least the number of vertices and the two numbers are equal if and only if the hypergraph belongs to one… (More)

- Laurent Beaudou, Antoine Gerbaud, Roland Grappe, Frédéric Palesi
- Graphs and Combinatorics
- 2010

Résumé We prove that two disjoint graphs must always be drawn separately on the Klein bottle in order to minimize the crossing number of the whole drawing.

- Laurent Beaudou, Paul Dorbec, Sylvain Gravier, Pranava K. Jha
- Discrete Math., Alg. and Appl.
- 2009

The planarity of the direct product of two graphs has been widely studied in the past. Surprisingly, the missing part is the product with K2, which seems to be less predictible. In this piece of work, we characterize which subdivisions of multipartite complete graphs, have their direct product with K2 planar. This can be seen as a step towards the… (More)

- Laurent Beaudou, Florent Foucaud, Reza Naserasr
- J. Comb. Theory, Ser. B
- 2017

We present a necessary and sufficient condition for a graph of odd-girth 2k + 1 to bound the class of K4-minor-free graphs of odd-girth (at least) 2k + 1, that is, to admit a homomorphism from any such K4-minor-free graph. This yields a polynomial-time algorithm to recognize such bounds. Using this condition, we first prove that every K4-minor free graph of… (More)

- Laurent Beaudou
- 2009