Jean-Sébastien Sereni

According to our database1, Jean-Sébastien Sereni authored at least 62 papers between 2005 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Eccentricity of networks with structural constraints.
Discuss. Math. Graph Theory, 2020

An algorithmic framework for colouring locally sparse graphs.
CoRR, 2020

On the effect of symmetry requirement for rendezvous on the complete graph.
CoRR, 2020

Variations on the Petersen Colouring Conjecture.
Electron. J. Comb., 2020

Revisiting a Theorem by Folkman on Graph Colouring.
Electron. J. Comb., 2020

2019
On Generalized Choice and Coloring Numbers.
Electron. J. Comb., 2019

2018
Extension from Precoloured Sets of Edges.
Electron. J. Comb., 2018

2017
Equitable colorings of $K_4$-minor-free graphs.
J. Graph Algorithms Appl., 2017

Do Triangle-Free Planar Graphs have Exponentially Many $3$-Colorings?
Electron. J. Comb., 2017

2016
Closeness centralization measure for two-mode data of prescribed sizes.
Netw. Sci., 2016

2015
Two-floor buildings need eight colors.
J. Graph Algorithms Appl., 2015

Fractional Coloring of Triangle-Free Planar Graphs.
Electron. J. Comb., 2015

Limits of Order Types.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
Transversals of Longest Paths and Cycles.
SIAM J. Discret. Math., 2014

Subcubic triangle-free graphs have fractional chromatic number at most 14/5.
J. Lond. Math. Soc., 2014

Extensions of Fractional Precolorings Show Discontinuous Behavior.
J. Graph Theory, 2014

Supersaturation in the Boolean Lattice.
Integers, 2014

2013
A tight bound on the set chromatic number.
Discuss. Math. Graph Theory, 2013

Toward more localized local algorithms: removing assumptions concerning global knowledge.
Distributed Comput., 2013

A New Bound for the 2/3 Conjecture.
Comb. Probab. Comput., 2013

Multiple Petersen Subdivisions in Permutation Graphs.
Electron. J. Comb., 2013

2012
Min-Max Relations for Odd Cycles in Planar Graphs.
SIAM J. Discret. Math., 2012

Griggs and Yeh's Conjecture and L(p, 1)-labelings.
SIAM J. Discret. Math., 2012

A New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points.
Discret. Comput. Geom., 2012

Collaborative search on the plane without communication.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

2011
Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring.
SIAM J. Discret. Math., 2011

Edge-face coloring of plane graphs with maximum degree nine.
J. Graph Theory, 2011

Characterization of graphs and digraphs with small process numbers.
Discret. Appl. Math., 2011

Graphs with Four Boundary Vertices.
Electron. J. Comb., 2011

The fractional chromatic number of Zykov products of graphs.
Appl. Math. Lett., 2011

2010
Equitable Coloring of Sparse Planar Graphs.
SIAM J. Discret. Math., 2010

The Last Fraction of a Fractional Conjecture.
SIAM J. Discret. Math., 2010

Graphs with bounded tree-width and large odd-girth are almost bipartite.
J. Comb. Theory, Ser. B, 2010

Facial colorings using Hall's Theorem.
Eur. J. Comb., 2010

A note on antisymmetric flows in graphs.
Eur. J. Comb., 2010

Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree.
Discret. Math., 2010

2009
A Step toward the Bermond--Thomassen Conjecture about Disjoint Cycles in Digraphs.
SIAM J. Discret. Math., 2009

A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs.
SIAM J. Discret. Math., 2009

Improper coloring of unit disk graphs.
Networks, 2009

Circular choosability.
J. Graph Theory, 2009

Circular edge-colorings of cubic graphs with girth six.
Electron. Notes Discret. Math., 2009

Projective, affine, and abelian colorings of cubic graphs.
Eur. J. Comb., 2009

Identifying and Locating-Dominating Codes in (Random) Geometric Networks.
Comb. Probab. Comput., 2009

About a Brooks-type theorem for improper colouring.
Australas. J Comb., 2009

2008
Total-Coloring of Plane Graphs with Maximum Degree Nine.
SIAM J. Discret. Math., 2008

3-Facial Coloring of Plane Graphs.
SIAM J. Discret. Math., 2008

List colorings with measurable sets.
J. Graph Theory, 2008

Graphs with full rank 3-color matrix and few 3-colorings.
J. Comb. Theory, Ser. B, 2008

Lower bounding the boundary of a graph in terms of its maximum or minimum degree.
Discret. Math., 2008

Improper colouring of (random) unit disk graphs.
Discret. Math., 2008

Randomly colouring graphs (a combinatorial view).
Comput. Sci. Rev., 2008

Guarding Art Galleries: The Extra Cost for Sculptures Is Linear.
Proceedings of the Algorithm Theory, 2008

L(2, 1)-labelling of graphs.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Pathwidth of outerplanar graphs.
J. Graph Theory, 2007

Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems.
Electron. Notes Discret. Math., 2007

Characterization of affine Steiner triple systems and Hall triple systems.
Electron. Notes Discret. Math., 2007

Two proofs of Bermond-Thomassen conjecture for regular tournaments.
Electron. Notes Discret. Math., 2007

2006
Colorations de graphes et applications. (Graph colorings and applications).
PhD thesis, 2006

Improper choosability of graphs and maximum average degree.
J. Graph Theory, 2006

3-facial colouring of plane graphs
CoRR, 2006

2005
Improper Colourings of Unit Disk Graphs.
Electron. Notes Discret. Math., 2005

Channel Assignment and Improper Choosability of Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005


  Loading...