Benjamin Lévêque

Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou: Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable. CoRR abs/1301.7090 (2013)

Benjamin Lévêque, Dominique de Werra: Graph transformations preserving the stability number. Discrete Applied Mathematics 160(18): 2752-2759 (2012)

Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou: Triangle Contact Representations and Duality. Discrete & Computational Geometry 48(1): 239-254 (2012)

Benjamin Lévêque, Frédéric Maffray, Nicolas Trotignon: On graphs with no induced subdivision of K₄. J. Comb. Theory, Ser. B 102(4): 924-947 (2012)

Kathie Cameron, Benjamin Lévêque, Frédéric Maffray: Coloring vertices of a graph or finding a Meyniel obstruction. Theor. Comput. Sci. 428: 10-17 (2012)

Daniel Gonçalves, Benjamin Lévêque: Toroidal maps : Schnyder woods, orthogonal surfaces and straight-line representations. CoRR abs/1202.0911 (2012)

Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul: Contracting chordal graphs and bipartite graphs to paths and trees. Electronic Notes in Discrete Mathematics 37: 87-92 (2011)

Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou: 2-distance coloring of sparse graphs. Electronic Notes in Discrete Mathematics 38: 155-160 (2011)

Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque: Characterizing directed path graphs by forbidden asteroids. Journal of Graph Theory 68(2): 103-112 (2011)

Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul: Contracting Graphs to Paths and Trees. IPEC 2011: 55-66

Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul: Contracting Graphs to Paths and Trees. CoRR abs/1104.3677 (2011)

Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou: Triangle Contact Representations and Duality. Graph Drawing 2010: 262-273

Steven Chaplick, Marisa Gutierrez, Benjamin Lévêque, Silvia B. Tondato: From Path Graphs to Directed Path Graphs. WG 2010: 256-265

Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon: Detecting induced subgraphs. Discrete Applied Mathematics 157(17): 3540-3551 (2009)

Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque: Asteroids in rooted and directed path graphs. Electronic Notes in Discrete Mathematics 32: 67-74 (2009)

Benjamin Lévêque, Dominique de Werra: Graph transformations preserving the stability number. Electronic Notes in Discrete Mathematics 35: 3-8 (2009)

Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann: Characterizing path graphs by forbidden induced subgraphs. Journal of Graph Theory 62(4): 369-384 (2009)

Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon: Coloring Artemis graphs. Theor. Comput. Sci. 410(21-23): 2234-2240 (2009)

Yannick Frein, Benjamin Lévêque, András Sebö: Generating All Sets With Bounded Unions. Combinatorics, Probability & Computing 17(5): 641-660 (2008)

Jean-Claude Bermond, David Coudert, Benjamin Lévêque: Approximations for All-to-All Uniform Traffic Grooming on Unidirectional Rings. Journal of Interconnection Networks 9(4): 471-486 (2008)

Benjamin Lévêque, Frédéric Maffray: Coloring Bull-Free Perfectly Contractile Graphs. SIAM J. Discrete Math. 21(4): 999-1018 (2008)

Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann: Characterizing path graphs by forbidden induced subgraphs. CoRR abs/0803.0956 (2008)

Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque: Asteroids in rooted and directed path graphs. CoRR abs/0812.2734 (2008)

Yannick Frein, Benjamin Lévêque, András Sebö: Optimizing diversity. Electronic Notes in Discrete Mathematics 29: 73-77 (2007)

Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon: Detecting induced subgraphs. Electronic Notes in Discrete Mathematics 29: 207-211 (2007)

Vincent Jost, Benjamin Lévêque, Frédéric Maffray: Precoloring Extension of Co-Meyniel Graphs. Graphs and Combinatorics 23(3): 291-301 (2007)

Yannick Frein, Benjamin Lévêque, András Sebö: Optimizing diversity. CoRR abs/0711.2998 (2007)

Benjamin Lévêque, Frédéric Maffray: Coloring Meyniel graphs in linear time. Electronic Notes in Discrete Mathematics 22: 25-28 (2005)

Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon: Coloring Artemis graphs. CoRR abs/cs/0504082 (2005)

Vincent Jost, Benjamin Lévêque, Frédéric Maffray: Precoloring co-Meyniel graphs. CoRR abs/cs/0509004 (2005)

Kathie Cameron, Jack Edmonds, Benjamin Lévêque, Frédéric Maffray: Coloring vertices of a graph or finding a Meyniel obstruction. CoRR abs/cs/0509023 (2005)

Benjamin Lévêque, Frédéric Maffray: Coloring Meyniel graphs in linear time. CoRR cs.DM/0405059 (2004)