Toward more Localized Local Algorithms: Removing Assumptions concerning Global Knowledge(Journal — BibTeX)
(With A. Korman and L. Viennot)
Distributed Computing, forthcoming.

A new bound for the 2/3 conjecture(PDF — Journal — BibTeX)
(With D. Král', C.-H. Liu, P. Whalen and Z. B. Yilma)
Combinatorics, Probability and Computing, 22(3):384--393, 2013.

A tight bound on the set chromatic number(PDF — Journal — BibTeX)
(With Z. B. Yilma)
Discussiones Mathematicae Graph Theory, 33(2):461--465, 2013.

Multiple Petersen subdivisions in permutation graphs(PDF — Journal — BibTeX)
(With T. Kaiser and Z. B. Yilma)
The Electronic Journal of Combinatorics, 20:#P11, 9pp., 2013.

A new lower bound based on Gromov’s method of selecting heavily covered points(PDF — Journal — BibTeX)
(With D. Král' and L. Mach)
Discrete and Computational Geometry, 48(2):487--498, 2012.

Griggs and Yeh's Conjecture and L(p,1)-labelings(PDF — Journal — BibTeX)
(With F. Havet and B. Reed)
SIAM Journal on Discrete Mathematics, 26(1):145--168, 2012.

Min-max relations for odd cycles in planar graphs(PDF — Journal — BibTeX)
(With D. Král' and L. Stacho)
SIAM Journal on Discrete Mathematics, 26(3):884--895, 2012.

Characterization of graphs and digraphs with small process number(PDF — Journal — BibTeX)
(With D. Coudert)
Discrete Applied Mathematics, 159(11):1094--1109, 2011.

Edge-face colouring of plane graphs with maximum degree nine(PDF — Journal — BibTeX)
(With M. Stehlík)
Journal of Graph Theory, 66(4):332--346, 2011.

Every plane graph of maximum degree 8 has an edge-face 9-colouring(PDF — Journal — BibTeX)
(With R. J. Kang and M. Stehlík)
SIAM Journal on Discrete Mathematics 25(2):514--533, 2011.

Graphs with four boundary vertices(PDF — Journal — BibTeX)
(With T. Müller and A. Pór)
The Electronic Journal of Combinatorics, 18:#P11, 18pp., 2011.

The Fractional Chromatic Number of Zykov Products of Graphs(PDF — Journal — BibTeX)
(With P. Charbit)
Applied Mathematics Letters, 24(4):432--437, 2011.

A note on antisymmetric flows in graphs(PDF — Journal — BibTeX)
(With Z. Dvořák, T. Kaiser and D. Král')
European Journal of Combinatorics, 31(1):320--324, 2010.

Characterisation results for Steiner triple systems and their application to edge-colourings of cubic graphs(PDF — Journal — BibTeX)
(With D. Král', E. Máčajová and A. Pór)
Canadian Journal of Mathematics, 62(2):355--381, 2010.

Circular edge-colorings of cubic graphs with girth six(PDF — Journal — BibTeX)
(With D. Král', E. Máčajová and J. Mazák)
Journal of Combinatorial Theory Ser. B, 100(4):351--358, 2010.

Equitable coloring of sparse planar graphs(PDF — Journal — BibTeX)
(With R. Luo, C. Stephen and G. Yu)
SIAM Journal on Discrete Mathematics, 24(4):1572--1583, 2010.

Facial colorings using Hall's Theorem(PDF — Journal — BibTeX)
(With F. Havet, D. Král' and R. Škrekovski)
European Journal of Combinatorics, 31(3):1001--1019, 2010.

Graphs with bounded tree-width and large odd-girth are almost bipartite(PDF — Journal — BibTeX)
(With A. Kostochka, D. Král' and M. Stiebitz)
Journal of Combinatorial Theory Ser. B, 100(6):554--559, 2010.

On the sextet polynomial of fullerenes(PDF — Journal — BibTeX)
(With M. Stehlík)
Journal of Mathematical Chemistry, 47(3):1121--1128, 2010.

The last fraction of a fractional conjecture(PDF — Journal — BibTeX)
(With F. Kardoš and D. Král')
SIAM Journal on Discrete Mathematics, 24(2):699--707, 2010.

Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree(PDF — Journal — BibTeX)
(With S. Bessy and N. Lichiardopol)
Discrete Mathematics, 310(3):557--560, 2010. (Special Issue devoted to the Sixth Czech-Slovak International Symposium on CGTAA, 2006.)

About a Brooks-type theorem for improper colouring(PDF — Journal — BibTeX)
(With R. Corrêa and F. Havet)
Australasian Journal of Combinatorics, 43:219--230, 2009.

A new lower bound on the number of perfect matchings in cubic graphs(PDF — Journal — BibTeX)
(With D. Král' and M. Stiebitz)
SIAM Journal on Discrete Mathematics, 23(3):1465--1483, 2009.

A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs(PDF — Journal — BibTeX)
(With N. Lichiardopol and A. Pór)
SIAM Journal on Discrete Mathematics, 23(2):979--992, 2009.

Circular Choosability(PDF — Journal — BibTeX)
(With F. Havet, R. J. Kang and T. Müller)
Journal of Graph Theory, 61(4):241--270, 2009.

Fullerene graphs have exponentially many perfect matchings(PDF — Journal — BibTeX)
(With F. Kardoš, D. Král' and J. Miškuf)
Journal of Mathematical Chemistry, 46(2):443--447, 2009.

Identifying and locating-dominating codes in (random) geometric networks(PDF — Journal — BibTeX)
(With T. Müller)
Combinatorics, Probability and Computing, 18(6):925--952, 2009.

Improper colouring of unit disk graphs(PDF — Journal — BibTeX)
(With F. Havet and R. J. Kang)
Networks, 54(3):150--164, 2009.

Long cycles in fullerene graphs(PDF — Journal — BibTeX)
(With D. Král', O. Prangrác and R. Škrekovski)
Journal of Mathematical Chemistry, 45(4):1021--1031, 2009.

Projective, affine, and abelian colourings of cubic graphs(PDF — Journal — BibTeX)
(With D. Král', E. Máčajová, O. Prangrác, A. Raspaud and M. Škoviera)
European Journal of Combinatorics, 30(1):53--69, 2009.

3-facial colouring of plane graphs(PDF — Journal — BibTeX)
(With F. Havet and R. Škrekovski)
SIAM Journal on Discrete Mathematics, 22(1):231--247, 2008.

Graphs with full rank 3-color matrix and few 3-colorings(PDF — Journal — BibTeX)
(With S. Norine)
Journal of Combinatorial Theory Ser. B, 98(5):1115--1116, 2008.

Improper colouring of (random) unit disk graphs(PDF — Journal — BibTeX)
(With R. J. Kang and T. Müller)
Discrete Mathematics, 308(8):1438--1454, 2008. (Special issue devoted to EuroComb 2005.)

List colorings with measurable sets(PDF — Journal — BibTeX)
(With J. Hladky, D. Král' and M. Stiebitz)
Journal of Graph Theory, 59(3):229--238, 2008.

Lower bounding the boundary of a graph in terms of its maximum or minimum degree(PDF — Journal — BibTeX)
(With T. Müller and A. Pór)
Discrete Mathematics, 308(24):6581--6583, 2008.

Randomly colouring graphs (a combinatorial view)(PDF — Journal — BibTeX)
Computer Science Review, 2(2):63--95, 2008.

Total colouring of plane graphs with maximum degree nine(PDF — Journal — BibTeX)
(With Ł. Kowalik and R. Škrekovski)
SIAM Journal on Discrete Mathematics, 22(4):1462--1479, 2008.

Orders with ten elements are circle orders(PDF — Journal — BibTeX)
(With R. Bayon and N. Lygeros)
Applied Mathematics E-Notes, 7:16--22, 2007.

Pathwidth of outerplanar graphs(PDF — Journal — BibTeX)
(With D. Coudert and F. Huc)
Journal of Graph Theory, 55(1):27--41, 2007.

Improper choosability of graphs and maximum average degree(PDF — Journal — BibTeX)
(With F. Havet)
Journal of Graph Theory, 52(3):181--199, 2006.

New progress in enumeration of mixed models(PDF — Journal — BibTeX)
(With R. Bayon and N. Lygeros)
Applied Mathematics E-Notes, 5:60--65, 2005.