Jean-Sébastien Sereni

Electron. J. Comb., 2024

2023

On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph.

[BibT_eX]

[DOI]

Marthe Bonamy

Michal Pilipczuk

Richard Weber

Math. Oper. Res., May, 2023

Diletter and triletter comma-free codes over finite alphabets.

[BibT_eX]

[DOI]

Elena Fimmel

Christian J. Michel

Lutz Strüngmann

Australas. J Comb., 2023

2022

The Minimum Number of Spanning Trees in Regular Multigraphs.

[BibT_eX]

[DOI]

Jakub Pekárek

Electron. J. Comb., 2022

Trinucleotide k-circular codes II: Biology.

[BibT_eX]

[DOI]

Christian J. Michel

Biosyst., 2022

Trinucleotide k-circular codes I: Theory.

[BibT_eX]

[DOI]

Christian J. Michel

Baptiste Mouillon

Biosyst., 2022

2021

Fractional Chromatic Number, Maximum Degree, and Girth.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Bipartite Independence Number in Graphs with Bounded Maximum Degree.

[BibT_eX]

[DOI]

Maria Axenovich

Richard Snyder

Lea Weber

SIAM J. Discret. Math., 2021

2020

Eccentricity of networks with structural constraints.

[BibT_eX]

[DOI]

Matjaz Krnc

Discuss. Math. Graph Theory, 2020

An algorithmic framework for colouring locally sparse graphs.

[BibT_eX]

[DOI]

Ewan Davies

CoRR, 2020

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

[BibT_eX]

[DOI]

Marthe Bonamy

Michal Pilipczuk

CoRR, 2020

Variations on the Petersen Colouring Conjecture.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

On Fractional Fragility Rates of Graph Classes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

Revisiting a Theorem by Folkman on Graph Colouring.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

On Generalized Choice and Coloring Numbers.

[BibT_eX]

[DOI]

Jakub Pekárek

Electron. J. Comb., 2019

2018

Extension from Precoloured Sets of Edges.

[BibT_eX]

[DOI]

Rémi de Joannis de Verclos

Electron. J. Comb., 2018

2017

Equitable colorings of $K_4$-minor-free graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Do Triangle-Free Planar Graphs have Exponentially Many $3$-Colorings?

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

2016

Closeness centralization measure for two-mode data of prescribed sizes.

[BibT_eX]

[DOI]

Matjaz Krnc

Netw. Sci., 2016

2015

Two-floor buildings need eight colors.

[BibT_eX]

[DOI]

Stéphane Bessy

Daniel Gonçalves

J. Graph Algorithms Appl., 2015

Fractional Coloring of Triangle-Free Planar Graphs.

[BibT_eX]

[DOI]

Rémi de Joannis de Verclos

Electron. J. Comb., 2015

Limits of Order Types.

[BibT_eX]

[DOI]

Xavier Goaoc

Alfredo Hubard

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Transversals of Longest Paths and Cycles.

[BibT_eX]

[DOI]

Dieter Rautenbach

SIAM J. Discret. Math., 2014

Subcubic triangle-free graphs have fractional chromatic number at most 14/5.

[BibT_eX]

[DOI]

J. Lond. Math. Soc., 2014

Extensions of Fractional Precolorings Show Discontinuous Behavior.

[BibT_eX]

[DOI]

Jan van den Heuvel

Martin Kupec

J. Graph Theory, 2014

Supersaturation in the Boolean Lattice.

[BibT_eX]

[DOI]

Andrew P. Dove

Jerrold R. Griggs

Integers, 2014

2013

A tight bound on the set chromatic number.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2013

Toward more localized local algorithms: removing assumptions concerning global knowledge.

[BibT_eX]

[DOI]

Amos Korman

Laurent Viennot

Distributed Comput., 2013

A New Bound for the 2/3 Conjecture.

[BibT_eX]

[DOI]

Chun-Hung Liu

Peter Whalen

Comb. Probab. Comput., 2013

Multiple Petersen Subdivisions in Permutation Graphs.

[BibT_eX]

[DOI]

Tomás Kaiser

Electron. J. Comb., 2013

2012

Min-Max Relations for Odd Cycles in Planar Graphs.

[BibT_eX]

[DOI]

Ladislav Stacho

SIAM J. Discret. Math., 2012

Griggs and Yeh's Conjecture and L(p, 1)-labelings.

[BibT_eX]

[DOI]

Bruce A. Reed

SIAM J. Discret. Math., 2012

A New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points.

[BibT_eX]

[DOI]

Lukás Mach

Discret. Comput. Geom., 2012

Collaborative search on the plane without communication.

[BibT_eX]

[DOI]

Ofer Feinerman

Amos Korman

Zvi Lotker

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.

[BibT_eX]

[DOI]

Matej Stehlík

SIAM J. Discret. Math., 2011

Edge-face coloring of plane graphs with maximum degree nine.

[BibT_eX]

[DOI]

Matej Stehlík

J. Graph Theory, 2011

Characterization of graphs and digraphs with small process numbers.

[BibT_eX]

[DOI]

David Coudert

Discret. Appl. Math., 2011

Graphs with Four Boundary Vertices.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

The fractional chromatic number of Zykov products of graphs.

[BibT_eX]

[DOI]

Pierre Charbit

Appl. Math. Lett., 2011

2010

Equitable Coloring of Sparse Planar Graphs.

[BibT_eX]

[DOI]

Rong Luo

D. Christopher Stephens

Gexin Yu

SIAM J. Discret. Math., 2010

The Last Fraction of a Fractional Conjecture.

[BibT_eX]

[DOI]

Frantisek Kardos

SIAM J. Discret. Math., 2010

Circular edge-colorings of cubic graphs with girth six.

[BibT_eX]

[DOI]

Edita Mácajová

Ján Mazák

J. Comb. Theory B, 2010

Graphs with bounded tree-width and large odd-girth are almost bipartite.

[BibT_eX]

[DOI]

Alexandr V. Kostochka

Michael Stiebitz

J. Comb. Theory B, 2010

Facial colorings using Hall's Theorem.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

A note on antisymmetric flows in graphs.

[BibT_eX]

[DOI]

Tomás Kaiser

Eur. J. Comb., 2010

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

[BibT_eX]

[DOI]

Stéphane Bessy

Nicolas Lichiardopol

Discret. Math., 2010

2009

A Step toward the Bermond--Thomassen Conjecture about Disjoint Cycles in Digraphs.

[BibT_eX]

[DOI]

Nicolas Lichiardopol

SIAM J. Discret. Math., 2009

A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs.

[BibT_eX]

[DOI]

Michael Stiebitz

SIAM J. Discret. Math., 2009

Improper coloring of unit disk graphs.

[BibT_eX]

[DOI]

Networks, 2009

Circular choosability.

[BibT_eX]

[DOI]

J. Graph Theory, 2009

Projective, affine, and abelian colorings of cubic graphs.

[BibT_eX]

[DOI]

Martin Skoviera

Eur. J. Comb., 2009

Identifying and Locating-Dominating Codes in (Random) Geometric Networks.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

About a Brooks-type theorem for improper colouring.

[BibT_eX]

[DOI]

Ricardo C. Corrêa

Australas. J Comb., 2009

2008

Total-Coloring of Plane Graphs with Maximum Degree Nine.

[BibT_eX]

[DOI]

Lukasz Kowalik

SIAM J. Discret. Math., 2008

3-Facial Coloring of Plane Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

List colorings with measurable sets.

[BibT_eX]

[DOI]

Jan Hladký

Michael Stiebitz

J. Graph Theory, 2008

Graphs with full rank 3-color matrix and few 3-colorings.

[BibT_eX]

[DOI]

Serguei Norine

J. Comb. Theory B, 2008

Lower bounding the boundary of a graph in terms of its maximum or minimum degree.

[BibT_eX]

[DOI]

Discret. Math., 2008

Improper colouring of (random) unit disk graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

Randomly colouring graphs (a combinatorial view).

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2008

Guarding Art Galleries: The Extra Cost for Sculptures Is Linear.

[BibT_eX]

[DOI]

Louigi Addario-Berry

Omid Amini

Stéphan Thomassé

Proceedings of the Algorithm Theory, 2008

L(2, 1)-labelling of graphs.

[BibT_eX]

[DOI]

Bruce A. Reed

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

Pathwidth of outerplanar graphs.

[BibT_eX]

[DOI]

David Coudert

Florian Huc

J. Graph Theory, 2007

Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems.

[BibT_eX]

[DOI]

Edita Mácajová

Electron. Notes Discret. Math., 2007

Characterization of affine Steiner triple systems and Hall triple systems.

[BibT_eX]

[DOI]

Edita Mácajová

Electron. Notes Discret. Math., 2007

Two proofs of Bermond-Thomassen conjecture for regular tournaments.

[BibT_eX]

[DOI]

Stéphane Bessy

Nicolas Lichiardopol

Electron. Notes Discret. Math., 2007

2006

Colorations de graphes et applications. (Graph colorings and applications).

[BibT_eX]

[DOI]

PhD thesis, 2006

Improper choosability of graphs and maximum average degree.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

3-facial colouring of plane graphs

[BibT_eX]

[DOI]

CoRR, 2006

2005

Improper Colourings of Unit Disk Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Channel Assignment and Improper Choosability of Graphs.

[BibT_eX]

[DOI]