Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
Exact Algorithms for L(2,1)-Labeling of GraphsHavet, Frédéric ; Klazar, Martin ; Kratochvíl, Jan ; Kratsch, Dieter ; Liedloff, MathieuAlgorithmica, 2011-02, Vol.59 (2), p.169-194 [Periódico revisado por pares]New York: Springer-VerlagTexto completo disponível |
|
2 |
Material Type: Artigo
|
Linear and 2-Frugal Choosability of Graphs of Small Maximum Average DegreeCohen, Nathann ; Havet, FrédéricGraphs and combinatorics, 2011-11, Vol.27 (6), p.831-849 [Periódico revisado por pares]Japan: Springer JapanTexto completo disponível |
|
3 |
Material Type: Artigo
|
ACYCLIC EDGE-COLORING OF PLANAR GRAPHSBASAVARAJU, Man ; SUNIL CHANDRAN, L ; COHEN, Nathann ; HAVET, Frédéric ; MÜLLER, TobiasSIAM journal on discrete mathematics, 2011-01, Vol.25 (1-2), p.463-478 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
|
4 |
Material Type: Artigo
|
Facial non-repetitive edge-coloring of plane graphsHavet, Frédéric ; Jendrol', Stanislav ; Soták, Roman ; Škrabul'áková, ErikaJournal of graph theory, 2011-01, Vol.66 (1), p.38-48 [Periódico revisado por pares]Hoboken: Wiley Subscription Services, Inc., A Wiley CompanyTexto completo disponível |
|
5 |
Material Type: Artigo
|
5-COLORING GRAPHS WITH 4 CROSSINGSERMIAN, Rok ; HAVET, Frédéric ; LIDICKY, Bernard ; PANGRAC, OndrejSIAM journal on discrete mathematics, 2011, Vol.25 (1-2), p.401-422 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
|
6 |
Material Type: Artigo
|
Finding an induced subdivision of a digraphBang-Jensen, Jørgen ; Havet, Frédéric ; Trotignon, NicolasElectronic notes in discrete mathematics, 2011-08, Vol.37, p.9-14Elsevier B.VTexto completo disponível |
|
7 |
Material Type: Artigo
|
Acyclic edge-colouring of planar graphsBasavaraju, Manu ; Chandran, L. Sunil ; Cohen, Nathann ; Havet, Frédéric ; Müller, TobiasSIAM journal on discrete mathematics, 2011, Vol.25 (2), p.436-478 [Periódico revisado por pares]Society for Industrial and Applied MathematicsTexto completo disponível |
|
8 |
Material Type: Capítulo de Livro
|
Weighted Improper ColouringAraujo, Julio ; Bermond, Jean-Claude ; Giroire, Frédéric ; Havet, Frédéric ; Mazauric, Dorian ; Modrzejewski, RemigiuszCombinatorial Algorithms, p.1-18 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergSem texto completo |
|
9 |
Material Type: Artigo
|
5-choosability of graphs with 2 crossingsCampos, Victor ; Havet, FrédéricarXiv.org, 2011-05Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
|
10 |
Material Type: Report
|
Enumerating the edge-colourings and total colourings of a regular graphBessy, Stéphane ; Havet, Frédéric2011Sem texto completo |