Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
On the semi-proper orientations of graphsDehghan, Ali ; Havet, FrédéricDiscrete Applied Mathematics, 2021-06, Vol.296, p.9-25 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
On the Nash number and the diminishing Grundy number of a graphHavet, Frédéric ; Ibiapina, Allen ; Rocha, LeonardoDiscrete Applied Mathematics, 2022-06, Vol.314, p.1-16 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
3 |
Material Type: Artigo
|
![]() |
On the unavoidability of oriented treesDross, François ; Havet, FrédéricJournal of combinatorial theory. Series B, 2021-11, Vol.151, p.83-110 [Periódico revisado por pares]Elsevier IncTexto completo disponível |
4 |
Material Type: Artigo
|
![]() |
On the Grundy and b-Chromatic Numbers of a GraphHavet, Frédéric ; Sampaio, LeonardoAlgorithmica, 2013-04, Vol.65 (4), p.885-899 [Periódico revisado por pares]New York: Springer-VerlagTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
Finding good 2-partitions of digraphs I. Hereditary propertiesBang-Jensen, J. ; Havet, FrédéricTheoretical computer science, 2016-07, Vol.636, p.85-94 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
On the Minimum Size of an Identifying Code Over All Orientations of a GraphCohen, Nathann ; Havet, FrédéricThe Electronic journal of combinatorics, 2018-03, Vol.25 (1) [Periódico revisado por pares]Open Journal SystemsTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
Powers of paths in tournamentsDraganić, Nemanja ; Dross, François ; Fox, Jacob ; Girão, António ; Havet, Frédéric ; Korándi, Dániel ; Lochet, William ; Correia, David Munhá ; Scott, Alex ; Sudakov, BennyCombinatorics, probability & computing, 2021-11, Vol.30 (6), p.894-898 [Periódico revisado por pares]Cambridge: Cambridge University PressTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
Constrained ear decompositions in graphs and digraphsHavet, Frederic ; Nisse, NicolasDiscrete Mathematics and Theoretical Computer Science, 2019-08, Vol.21 (4), p.COV2-19 [Periódico revisado por pares]Nancy: DMTCSTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification ProblemsGuillemot, Sylvain ; Havet, Frédéric ; Paul, Christophe ; Perez, AnthonyAlgorithmica, 2013-04, Vol.65 (4), p.900-926 [Periódico revisado por pares]Springer VerlagTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
Choosability of the square of planar subcubic graphs with large girthHavet, F.Discrete mathematics, 2009-06, Vol.309 (11), p.3553-3563 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |