Benjamin Lévêque

Moritz Mühlenthaler

Thomas Suzan

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

Local certification of graphs on surfaces.

[BibT_eX]

[DOI]

Louis Esperet

Theor. Comput. Sci., 2022

2021

A bijection for essentially 3-connected toroidal maps.

[BibT_eX]

[DOI]

Nicolas Bonichon

Éric Fusy

Eur. J. Comb., 2021

2020

Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth.

[BibT_eX]

[DOI]

Éric Fusy

J. Comb. Theory, Ser. A, 2020

2019

On the structure of Schnyder woods on orientable surfaces.

[BibT_eX]

[DOI]

Kolja Knauer

J. Comput. Geom., 2019

Homothetic triangle representations of planar graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Scaling limits for random triangulations on the torus.

[BibT_eX]

[DOI]

Vincent Beffara

Cong Bang Huynh

CoRR, 2019

A Bijection for Essentially 4-Connected Toroidal Triangulations.

[BibT_eX]

[DOI]

Nicolas Bonichon

Electron. J. Comb., 2019

2017

Encoding Toroidal Triangulations.

[BibT_eX]

[DOI]

Vincent Despré

Discret. Comput. Geom., 2017

Generalization of Schnyder woods to orientable surfaces and applications.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Planar graphs with Δ≥7 and no triangle adjacent to a C4 are minimally edge and total choosable.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2016

Generalization of Schnyder woods to orientable surfaces and applications.

[BibT_eX]

[DOI]

, 2016

2015

Asteroidal quadruples in non rooted path graphs.

[BibT_eX]

[DOI]

Marisa Gutierrez

Silvia B. Tondato

Discuss. Math. Graph Theory, 2015

Structure of Schnyder labelings on orientable surfaces.

[BibT_eX]

[DOI]

Kolja B. Knauer

CoRR, 2015

2014

List coloring the square of sparse graphs with large degree.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable.

[BibT_eX]

[DOI]

Discret. Math., 2014

Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

Planar graphs with $Δ\geq 7$ and no triangle adjacent to a C4 are minimally edge and total choosable.

[BibT_eX]

[DOI]

CoRR, 2014

Contracting Graphs to Paths and Trees.

[BibT_eX]

[DOI]

Algorithmica, 2014

2013

Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable

[BibT_eX]

[DOI]

CoRR, 2013

2012

Coloring vertices of a graph or finding a Meyniel obstruction.

[BibT_eX]

[DOI]

Kathie Cameron

Theor. Comput. Sci., 2012

On graphs with no induced subdivision of K4.

[BibT_eX]

[DOI]

Nicolas Trotignon

J. Comb. Theory, Ser. B, 2012

Triangle Contact Representations and Duality.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2012

2011

Characterizing directed path graphs by forbidden asteroids.

[BibT_eX]

[DOI]

Kathie Cameron

Chính T. Hoàng

J. Graph Theory, 2011

Contracting chordal graphs and bipartite graphs to paths and trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2-distance coloring of sparse graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

From Path Graphs to Directed Path Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

2009

Coloring Artemis graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Characterizing path graphs by forbidden induced subgraphs.

[BibT_eX]

[DOI]

Myriam Preissmann

J. Graph Theory, 2009

Graph transformations preserving the stability number.

[BibT_eX]

[DOI]

Dominique de Werra

Electron. Notes Discret. Math., 2009

Asteroids in rooted and directed path graphs.

[BibT_eX]

[DOI]

Kathie Cameron

Chính T. Hoàng

Electron. Notes Discret. Math., 2009

2008

Coloring Bull-Free Perfectly Contractile Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Approximations for All-to-All Uniform Traffic Grooming on Unidirectional Rings.

[BibT_eX]

[DOI]

Jean-Claude Bermond

David Coudert

J. Interconnect. Networks, 2008

Generating All Sets With Bounded Unions.

[BibT_eX]

[DOI]

Yannick Frein

András Sebö

Comb. Probab. Comput., 2008

2007

Coloration de graphes : structures et algorithmes. (Coloring graphs : structures and algorithms).

[BibT_eX]

[DOI]

PhD thesis, 2007

Precoloring Extension of Co-Meyniel Graphs.

[BibT_eX]

[DOI]

Vincent Jost

Graphs Comb., 2007

Detecting induced subgraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Optimizing diversity.

[BibT_eX]

[DOI]

Yannick Frein

András Sebö

Electron. Notes Discret. Math., 2007

2005

Coloring Meyniel graphs in linear time.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Coloring vertices of a graph or finding a Meyniel obstruction

[BibT_eX]

[DOI]

CoRR, 2005

Precoloring co-Meyniel graphs

[BibT_eX]

[DOI]

Vincent Jost