Frédéric Havet

	2012
53		Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé: On spanning galaxies in digraphs. Discrete Applied Mathematics 160(6): 744-754 (2012)
52		Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni: Griggs and Yeh's Conjecture and L(p, 1)-labelings. SIAM J. Discrete Math. 26(1): 145-168 (2012)
	2011
51		Júlio Araújo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski: Weighted Improper Colouring. IWOCA 2011: 1-18
50		Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Exact Algorithms for L(2, 1)-Labeling of Graphs. Algorithmica 59(2): 169-194 (2011)
49		Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon: Finding an induced subdivision of a digraph. Electronic Notes in Discrete Mathematics 37: 9-14 (2011)
48		Nathann Cohen, Frédéric Havet: Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree. Graphs and Combinatorics 27(6): 831-849 (2011)
47		Frédéric Havet, Stanislav Jendrol, Roman Sotak, Erika Skrabul'áková: Facial non-repetitive edge-coloring of plane graphs. Journal of Graph Theory 66(1): 38-48 (2011)
46		Rok Erman, Frédéric Havet, Bernard Lidický, Ondrej Pangrác: 5-Coloring Graphs with 4 Crossings. SIAM J. Discrete Math. 25(1): 401-422 (2011)
45		Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, Tobias Müller: Acyclic Edge-Coloring of Planar Graphs. SIAM J. Discrete Math. 25(2): 463-478 (2011)
	2010
44		Frédéric Havet, Leonardo Sampaio: On the Grundy Number of a Graph. IPEC 2010: 170-179
43		Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé: WDM and Directed Star Arboricity. Combinatorics, Probability & Computing 19(2): 161-182 (2010)
42		Nicole Eggemann, Frédéric Havet, Steven D. Noble: k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4. Discrete Applied Mathematics 158(16): 1777-1788 (2010)
41		Frédéric Havet, Min-Li Yu: Corrigendum to "(p, 1)-total labelling of graphs" [Discrete Mathematics 308 (2008) 496-513]. Discrete Mathematics 310(15-16): 2219-2220 (2010)
40		Nathann Cohen, Frédéric Havet: Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof. Discrete Mathematics 310(21): 3049-3051 (2010)
39		Marie Asté, Frédéric Havet, Cláudia Linhares Sales: Grundy number and products of graphs. Discrete Mathematics 310(9): 1482-1490 (2010)
38		Frédéric Havet, Daniel Král', Jean-Sébastien Sereni, Riste Skrekovski: Facial colorings using Hall's Theorem. Eur. J. Comb. 31(3): 1001-1019 (2010)
	2009
37		Frédéric Havet, Stéphan Thomassé: Complexity of (p, 1)-total labelling. Discrete Applied Mathematics 157(13): 2859-2870 (2009)
36		Frédéric Havet: Choosability of the square of planar subcubic graphs with large girth. Discrete Mathematics 309(11): 3553-3563 (2009)
35		Daniel Gonçalves, Alexandre Pinlou, Stéphan Thomassé, Frédéric Havet: Spanning galaxies in digraphs. Electronic Notes in Discrete Mathematics 34: 139-143 (2009)
34		Nathann Cohen, Frédéric Havet, Tobias Müller: Acyclic edge-colouring of planar graphs. Extended abstract. Electronic Notes in Discrete Mathematics 34: 417-421 (2009)
33		Júlio Araújo, Nathann Cohen, Frédéric Giroire, Frédéric Havet: Good edge-labelling of graphs. Electronic Notes in Discrete Mathematics 35: 275-280 (2009)
32		Frédéric Havet, Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni: Circular choosability. Journal of Graph Theory 61(4): 241-270 (2009)
31		Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni: Improper coloring of unit disk graphs. Networks 54(3): 150-164 (2009)
	2008
30		Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni: L(2, 1)-labelling of graphs. SODA 2008: 621-630
29		Frédéric Havet, Stéphan Thomassé, Anders Yeo: Hoàng-Reed conjecture holds for tournaments. Discrete Mathematics 308(15): 3412-3415 (2008)
28		Frédéric Havet, Min-Li Yu: (p, 1)-Total labelling of graphs. Discrete Mathematics 308(4): 496-513 (2008)
27		Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour: Bisimplicial vertices in even-hole-free graphs. J. Comb. Theory, Ser. B 98(6): 1119-1164 (2008)
26		Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski: 3-Facial Coloring of Plane Graphs. SIAM J. Discrete Math. 22(1): 231-247 (2008)
	2007
25		Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé: WDM and Directed Star Arboricity CoRR abs/0705.0315: (2007)
24		Frédéric Havet, Jan van den Heuvel, Colin McDiarmid, Bruce A. Reed: List Colouring Squares of Planar Graphs. Electronic Notes in Discrete Mathematics 29: 515-519 (2007)
23		Louigi Addario-Berry, Frédéric Havet, Stéphan Thomassé: Paths with two blocks in n-chromatic digraphs. J. Comb. Theory, Ser. B 97(4): 620-626 (2007)
	2006
22		Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski: 3-facial colouring of plane graphs CoRR abs/cs/0607008: (2006)
21		Frédéric Havet, Jean-Sébastien Sereni: Improper choosability of graphs and maximum average degree. Journal of Graph Theory 52(3): 181-199 (2006)
20		Stéphane Bessy, Frédéric Havet, Etienne Birmelé: Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. Journal of Graph Theory 53(4): 315-332 (2006)
19		Frédéric Havet: Repartitors, Selectors and Superselectors. Journal of Interconnection Networks 7(3): 391-415 (2006)
18		Jean-Claude Bermond, Frédéric Havet, Csaba D. Tóth: Fault tolerant on-board networks with priorities. Networks 47(1): 9-25 (2006)
	2005
17		Frédéric Havet, Jean-Sébastien Sereni: Channel Assignment and Improper Choosability of Graphs. WG 2005: 81-90
16		Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni: Improper Colourings of Unit Disk Graphs. Electronic Notes in Discrete Mathematics 22: 123-128 (2005)
	2004
15		Stéphan Ceroi, Frédéric Havet: Trees with three leaves are (n+1)-unavoidable. Discrete Applied Mathematics 141(1-3): 19-39 (2004)
14		Frédéric Havet: Stable set meeting every longest path. Discrete Mathematics 289(1-3): 169-173 (2004)
13		Frédéric Havet: Pancyclic arcs and connectivity in tournaments. Journal of Graph Theory 47(2): 87-110 (2004)
12		Frédéric Havet, Marc Wennink: The Push Tree problem. Networks 44(4): 281-291 (2004)
	2003
11		Frédéric Havet: On Unavoidability of Trees with kLeaves. Graphs and Combinatorics 19(1): 101-110 (2003)
	2002
10		Frédéric Havet: Design of Fault Tolerant Satellite Networks with Priorities via Selectors. SIROCCO 2002: 165-179
9		Frédéric Havet: Trees in tournaments. Discrete Mathematics 243(1-3): 121-134 (2002)
8		Frédéric Havet, Janez Zerovnik: Finding a five bicolouring of a triangle-free subgraph of the triangular lattice. Discrete Mathematics 244(1-3): 103-108 (2002)
	2001
7		Frédéric Havet, Marc Wennink: The push tree problem. SPAA 2001: 318-319
6		Frédéric Havet: Channel assignment and multicolouring of the induced subgraphs of the triangular lattice. Discrete Mathematics 233(1-3): 219-231 (2001)
5		Stéphan Ceroi, Frédéric Havet: Trees with three leaves are (n + l)-unavoidable. Electronic Notes in Discrete Mathematics 7: 202-205 (2001)
	2000
4		Frédéric Havet: Trees in tournaments. Electronic Notes in Discrete Mathematics 5: 166-169 (2000)
3		Frédéric Havet: Finding an Oriented Hamiltonian Path in a Tournament. J. Algorithms 36(2): 253-275 (2000)
2		Frédéric Havet, Stéphan Thomassé: Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture. J. Comb. Theory, Ser. B 78(2): 243-273 (2000)
1		Frédéric Havet: Oriented Hamiltonian Cycles in Tournaments. J. Comb. Theory, Ser. B 80(1): 1-31 (2000)

Coauthor Index

1	Louigi Addario-Berry	[23] [27]
2	Omid Amini	[25] [43]
3	Júlio Araújo	[33] [51]
4	Marie Asté	[39]
5	Jørgen Bang-Jensen	[49]
6	Manu Basavaraju	[45]
7	Jean-Claude Bermond	[18] [51]
8	Stéphane Bessy	[20]
9	Etienne Birmelé	[20]
10	Stéphan Ceroi	[5] [15]
11	L. Sunil Chandran	[45]
12	Maria Chudnovsky	[27]
13	Nathann Cohen	[33] [34] [40] [45] [48]
14	Nicole Eggemann	[42]
15	Rok Erman	[46]
16	Frédéric Giroire	[33] [51]
17	Daniel Gonçalves	[35] [53]
18	Jan van den Heuvel	[24]
19	Florian Huc	[25] [43]
20	Stanislav Jendrol	[47]
21	Ross J. Kang	[16] [31] [32]
22	Martin Klazar	[50]
23	Daniel Král (Daniel Král')	[38]
24	Jan Kratochvíl	[50]
25	Dieter Kratsch	[50]
26	Bernard Lidický	[46]
27	Mathieu Liedloff	[50]
28	Dorian Mazauric	[51]
29	Colin McDiarmid (Colin J. H. McDiarmid)	[24]
30	Remigiusz Modrzejewski	[51]
31	Tobias Müller	[32] [34] [45]
32	Steven D. Noble	[42]
33	Ondrej Pangrác	[46]
34	Alexandre Pinlou	[35] [53]
35	Bruce A. Reed	[24] [27] [30] [52]
36	Cláudia Linhares Sales	[39]
37	Leonardo Sampaio	[44]
38	Jean-Sébastien Sereni	[16] [17] [21] [22] [26] [30] [31] [32] [38] [52]
39	Paul D. Seymour	[27]
40	Erika Skrabul'áková	[47]
41	Riste Skrekovski	[22] [26] [38]
42	Roman Sotak	[47]
43	Stéphan Thomassé	[2] [23] [25] [29] [35] [37] [43] [53]
44	Csaba D. Tóth	[18]
45	Nicolas Trotignon	[49]
46	Marc Wennink	[7] [12]
47	Anders Yeo	[29]
48	Min-Li Yu	[28] [41]
49	Janez Zerovnik	[8]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page