Search results for "Frédéric Havet"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	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.	2012	DBLP DOI BibTeX RDF
1	Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé	On spanning galaxies in digraphs.	Discrete Applied Mathematics	2012	DBLP DOI BibTeX RDF
1	Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon	Finding an induced subdivision of a digraph.	Electronic Notes in Discrete Mathematics	2011	DBLP DOI BibTeX RDF
1	Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff	Exact Algorithms for L(2, 1)-Labeling of Graphs.	Algorithmica	2011	DBLP DOI BibTeX RDF
1	Nathann Cohen, Frédéric Havet	Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree.	Graphs and Combinatorics	2011	DBLP DOI BibTeX RDF
1	Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, Tobias Müller	Acyclic Edge-Coloring of Planar Graphs.	SIAM J. Discrete Math.	2011	DBLP DOI BibTeX RDF
1	Rok Erman, Frédéric Havet, Bernard Lidický, Ondrej Pangrác	5-Coloring Graphs with 4 Crossings.	SIAM J. Discrete Math.	2011	DBLP DOI BibTeX RDF
1	Frédéric Havet, Stanislav Jendrol, Roman Sotak, Erika Skrabul'áková	Facial non-repetitive edge-coloring of plane graphs.	Journal of Graph Theory	2011	DBLP DOI BibTeX RDF
1	Júlio Araújo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski	Weighted Improper Colouring.	IWOCA	2011	DBLP DOI BibTeX RDF
1	Nathann Cohen, Frédéric Havet	Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof.	Discrete Mathematics	2010	DBLP DOI BibTeX RDF
1	Frédéric Havet, Min-Li Yu	Corrigendum to "(p, 1)-total labelling of graphs" [Discrete Mathematics 308 (2008) 496-513].	Discrete Mathematics	2010	DBLP DOI BibTeX RDF
1	Marie Asté, Frédéric Havet, Cláudia Linhares Sales	Grundy number and products of graphs.	Discrete Mathematics	2010	DBLP DOI BibTeX RDF
1	Frédéric Havet, Daniel Král', Jean-Sébastien Sereni, Riste Skrekovski	Facial colorings using Hall's Theorem.	Eur. J. Comb.	2010	DBLP DOI BibTeX RDF
1	Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé	WDM and Directed Star Arboricity.	Combinatorics, Probability & Computing	2010	DBLP DOI BibTeX RDF
1	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	2010	DBLP DOI BibTeX RDF
1	Frédéric Havet, Leonardo Sampaio	On the Grundy Number of a Graph.	IPEC	2010	DBLP DOI BibTeX RDF
1	Júlio Araújo, Nathann Cohen, Frédéric Giroire, Frédéric Havet	Good edge-labelling of graphs.	Electronic Notes in Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Daniel Gonçalves, Alexandre Pinlou, Stéphan Thomassé, Frédéric Havet	Spanning galaxies in digraphs.	Electronic Notes in Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Nathann Cohen, Frédéric Havet, Tobias Müller	Acyclic edge-colouring of planar graphs. Extended abstract.	Electronic Notes in Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Frédéric Havet	Choosability of the square of planar subcubic graphs with large girth.	Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni	Improper coloring of unit disk graphs.	Networks	2009	DBLP DOI BibTeX RDF
1	Frédéric Havet, Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni	Circular choosability.	Journal of Graph Theory	2009	DBLP DOI BibTeX RDF
1	Frédéric Havet, Stéphan Thomassé	Complexity of (p, 1)-total labelling.	Discrete Applied Mathematics	2009	DBLP DOI BibTeX RDF
1	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	2008	DBLP DOI BibTeX RDF
1	Frédéric Havet, Stéphan Thomassé, Anders Yeo	Hoàng-Reed conjecture holds for tournaments.	Discrete Mathematics	2008	DBLP DOI BibTeX RDF
1	Frédéric Havet, Min-Li Yu	(p, 1)-Total labelling of graphs.	Discrete Mathematics	2008	DBLP DOI BibTeX RDF
1	Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski	3-Facial Coloring of Plane Graphs.	SIAM J. Discrete Math.	2008	DBLP DOI BibTeX RDF
1	Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni	L(2, 1)-labelling of graphs.	SODA	2008	DBLP DOI BibTeX RDF
1	Louigi Addario-Berry, Frédéric Havet, Stéphan Thomassé	Paths with two blocks in n-chromatic digraphs.	J. Comb. Theory, Ser. B	2007	DBLP DOI BibTeX RDF
1	Frédéric Havet, Jan van den Heuvel, Colin McDiarmid, Bruce A. Reed	List Colouring Squares of Planar Graphs.	Electronic Notes in Discrete Mathematics	2007	DBLP DOI BibTeX RDF
1	Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé	WDM and Directed Star Arboricity	CoRR	2007	DBLP BibTeX RDF
1	Jean-Claude Bermond, Frédéric Havet, Csaba D. Tóth	Fault tolerant on-board networks with priorities.	Networks	2006	DBLP DOI BibTeX RDF
1	Frédéric Havet	Repartitors, Selectors and Superselectors.	Journal of Interconnection Networks	2006	DBLP DOI BibTeX RDF
1	Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski	3-facial colouring of plane graphs	CoRR	2006	DBLP BibTeX RDF
1	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	2006	DBLP DOI BibTeX RDF
1	Frédéric Havet, Jean-Sébastien Sereni	Improper choosability of graphs and maximum average degree.	Journal of Graph Theory	2006	DBLP DOI BibTeX RDF
1	Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni	Improper Colourings of Unit Disk Graphs.	Electronic Notes in Discrete Mathematics	2005	DBLP DOI BibTeX RDF
1	Frédéric Havet, Jean-Sébastien Sereni	Channel Assignment and Improper Choosability of Graphs.	WG	2005	DBLP DOI BibTeX RDF
1	Frédéric Havet	Stable set meeting every longest path.	Discrete Mathematics	2004	DBLP DOI BibTeX RDF
1	Frédéric Havet, Marc Wennink	The Push Tree problem.	Networks	2004	DBLP DOI BibTeX RDF
1	Frédéric Havet	Pancyclic arcs and connectivity in tournaments.	Journal of Graph Theory	2004	DBLP DOI BibTeX RDF
1	Stéphan Ceroi, Frédéric Havet	Trees with three leaves are (n+1)-unavoidable.	Discrete Applied Mathematics	2004	DBLP DOI BibTeX RDF
1	Frédéric Havet	On Unavoidability of Trees with kLeaves.	Graphs and Combinatorics	2003	DBLP DOI BibTeX RDF
1	Frédéric Havet, Janez Zerovnik	Finding a five bicolouring of a triangle-free subgraph of the triangular lattice.	Discrete Mathematics	2002	DBLP DOI BibTeX RDF
1	Frédéric Havet	Trees in tournaments.	Discrete Mathematics	2002	DBLP DOI BibTeX RDF
1	Frédéric Havet	Design of Fault Tolerant Satellite Networks with Priorities via Selectors.	SIROCCO	2002	DBLP BibTeX RDF
1	Stéphan Ceroi, Frédéric Havet	Trees with three leaves are (n + l)-unavoidable.	Electronic Notes in Discrete Mathematics	2001	DBLP DOI BibTeX RDF
1	Frédéric Havet	Channel assignment and multicolouring of the induced subgraphs of the triangular lattice.	Discrete Mathematics	2001	DBLP DOI BibTeX RDF
1	Frédéric Havet, Marc Wennink	The push tree problem.	SPAA	2001	DBLP DOI BibTeX RDF	Dynamic data replication, network optimisation, worst case analysis
1	Frédéric Havet	Oriented Hamiltonian Cycles in Tournaments.	J. Comb. Theory, Ser. B	2000	DBLP DOI BibTeX RDF
1	Frédéric Havet, Stéphan Thomassé	Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture.	J. Comb. Theory, Ser. B	2000	DBLP DOI BibTeX RDF
1	Frédéric Havet	Trees in tournaments.	Electronic Notes in Discrete Mathematics	2000	DBLP DOI BibTeX RDF
1	Frédéric Havet	Finding an Oriented Hamiltonian Path in a Tournament.	J. Algorithms	2000	DBLP DOI BibTeX RDF

Publications of "Frédéric Havet" ( http://dblp.L3S.de/Authors/Frédéric_Havet )