The SCEAS System
| |||||||

## Search the dblp DataBase
Frédéric Havet:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Frédéric Havet
**Design of Fault Tolerant Satellite Networks with Priorities via Selectors.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2002, pp:165-179 [Conf] - Frédéric Havet, Marc Wennink
**The push tree problem.**[Citation Graph (0, 0)][DBLP] SPAA, 2001, pp:318-319 [Conf] - Frédéric Havet, Jean-Sébastien Sereni
**Channel Assignment and Improper Choosability of Graphs.**[Citation Graph (0, 0)][DBLP] WG, 2005, pp:81-90 [Conf] - Stéphan Ceroi, F. Havet
**Trees with three leaves are (n+1)-unavoidable.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:19-39 [Journal] - Frédéric Havet
**Stable set meeting every longest path.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:289, n:1-3, pp:169-173 [Journal] - Frédéric Havet
**Trees in tournaments.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:243, n:1-3, pp:121-134 [Journal] - Frédéric Havet, Janez Zerovnik
**Finding a five bicolouring of a triangle-free subgraph of the triangular lattice.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:244, n:1-3, pp:103-108 [Journal] - Frédéric Havet
**Channel assignment and multicolouring of the induced subgraphs of the triangular lattice.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:233, n:1-3, pp:219-231 [Journal] - Frédéric Havet
**Finding an Oriented Hamiltonian Path in a Tournament.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:36, n:2, pp:253-275 [Journal] - Frédéric Havet
**Oriented Hamiltonian Cycles in Tournaments.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2000, v:80, n:1, pp:1-31 [Journal] - Frédéric Havet, Stéphan Thomassé
**Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2000, v:78, n:2, pp:243-273 [Journal] - Frédéric Havet, Marc Wennink
**The Push Tree problem.**[Citation Graph (0, 0)][DBLP] Networks, 2004, v:44, n:4, pp:281-291 [Journal] - Frédéric Havet, Jean-Sébastien Sereni
**Improper choosability of graphs and maximum average degree.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2006, v:52, n:3, pp:181-199 [Journal] - Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé
**WDM and Directed Star Arboricity**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski
**3-facial colouring of plane graphs**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Louigi Addario-Berry, Frédéric Havet, Stéphan Thomassé
**Paths with two blocks in n-chromatic digraphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2007, v:97, n:4, pp:620-626 [Journal] **L(2, 1)-labelling of graphs.**[Citation Graph (, )][DBLP]**Complexity of (p, 1)-total labelling.**[Citation Graph (, )][DBLP]**k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4.**[Citation Graph (, )][DBLP]**(p, 1)-Total labelling of graphs.**[Citation Graph (, )][DBLP]**Hoàng-Reed conjecture holds for tournaments.**[Citation Graph (, )][DBLP]**Choosability of the square of planar subcubic graphs with large girth.**[Citation Graph (, )][DBLP]**Grundy number and products of graphs.**[Citation Graph (, )][DBLP]**Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof.**[Citation Graph (, )][DBLP]**Corrigendum to "(p, 1)-total labelling of graphs" [Discrete Mathematics 308 (2008) 496-513].**[Citation Graph (, )][DBLP]**Facial colorings using Hall's Theorem.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |