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 proper orientation number of bipartite graphsAraujo, Julio ; Cohen, Nathann ; de Rezende, Susanna F. ; Havet, Frédéric ; Moura, Phablo F.S.Theoretical computer science, 2015-02, Vol.566, p.59-75 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
3 |
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 |
4 |
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 |
5 |
Material Type: Artigo
|
![]() |
(Circular) backbone colouring: Forest backbones in planar graphsHavet, Frédéric ; King, Andrew D. ; Liedloff, Mathieu ; Todinca, IoanDiscrete Applied Mathematics, 2014-05, Vol.169, p.119-134 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
Overlaying a hypergraph with a graph with bounded maximum degreeHavet, Frédéric ; Mazauric, Dorian ; Nguyen, Viet-Ha ; Watrigant, RémiDiscrete Applied Mathematics, 2022-10, Vol.319, p.394-406 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
Proper orientation of cactiAraujo, Julio ; Havet, Frédéric ; Linhares Sales, Claudia ; Silva, AnaTheoretical computer science, 2016-08, Vol.639, p.14-25 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
8 |
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 |
9 |
Material Type: Artigo
|
![]() |
Coloring Graphs with Constraints on ConnectivityAboulker, Pierre ; Brettell, Nick ; Havet, Frédéric ; Marx, Dániel ; Trotignon, NicolasJournal of graph theory, 2017-08, Vol.85 (4), p.814-838 [Periódico revisado por pares]Hoboken: Wiley Subscription Services, IncTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
On the inversion number of oriented graphsBang-Jensen, Jørgen ; da Silva, Jonas Costa Ferreira ; Havet, FrédéricDiscrete mathematics and theoretical computer science, 2021-04, Vol.23 (2), p.1-29 [Periódico revisado por pares]Nancy: DMTCSTexto completo disponível |