Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
Finding good 2-partitions of digraphs II. Enumerable propertiesBang-Jensen, J. ; Cohen, Nathann ; Havet, FrédéricTheoretical computer science, 2016-08, Vol.640, p.1-19 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
Subdivisions of oriented cycles in digraphs with large chromatic numberCohen, Nathann ; Havet, Frédéric ; Lochet, William ; Nisse, NicolasJournal of graph theory, 2018-12, Vol.89 (4), p.439-456 [Periódico revisado por pares]Hoboken: Wiley Subscription Services, IncTexto completo disponível |
3 |
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 |
4 |
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 |
5 |
Material Type: Artigo
|
![]() |
( p , 1 ) -Total labelling of graphsHavet, Frédéric ; Yu, Min-LiDiscrete mathematics, 2008-02, Vol.308 (4), p.496-513 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
The game Grundy number of graphsHavet, Frédéric ; Zhu, XudingJournal of combinatorial optimization, 2013-05, Vol.25 (4), p.752-765 [Periódico revisado por pares]Boston: Springer USTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
Planar graphs with maximum degree Δ ≥ 9 are ( Δ + 1 ) -edge-choosable—A short proofCohen, Nathann ; Havet, FrédéricContributions to discrete mathematics, 2010-11, Vol.310 (21), p.3049-3051 [Periódico revisado por pares]Kidlington: Elsevier B.VTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2Bang‐Jensen, Jørgen ; Bessy, Stéphane ; Havet, Frédéric ; Yeo, AndersJournal of graph theory, 2022-06, Vol.100 (2), p.294-314 [Periódico revisado por pares]Hoboken: Wiley Subscription Services, IncTexto completo disponível |
9 |
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 |
10 |
Material Type: Artigo
|
![]() |
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic NumberAboulker, Pierre ; Cohen, Nathann ; Havet, Frédéric ; Lochet, William ; Moura, Phablo F. S. ; Thomassé, StéphanThe Electronic journal of combinatorics, 2019-07, Vol.26 (3) [Periódico revisado por pares]Open Journal SystemsTexto completo disponível |