E-LIB Suche - Ergebnisse für: HAVET, FRÉDÉRIC

1

On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicriti..:

Aboulker, Pierre ; Bellitto, Thomas ; Havet, Frédéric.
SIAM Journal on Discrete Mathematics. 38 (2024) 2 - p. 1863-1901 , 2024

Link: https://doi.org/10.1137/..

2

On Finding the Best and Worst Orientations for the Metric D..:

Araujo, Julio ; Bensmail, Julien ; Campos, Victor...
Algorithmica. , 2023

Link: https://doi.org/10.1007/..

3

On the Minimum Number of Arcs in 4-Dicritical Oriented Grap..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Havet, Frédéric ; Picasarri-Arrieta, Lucas ; Rambaud, Clément - p. 376-387 , 2023

Link: https://doi.org/10.1007/..

4

Spanning eulerian subdigraphs in semicomplete digraphs:

Bang‐Jensen, Jørgen ; Havet, Frédéric ; Yeo, Anders
Journal of Graph Theory. 102 (2022) 3 - p. 578-606 , 2022

Link: https://doi.org/10.1002/..

5

Overlaying a hypergraph with a graph with bounded maximum d..:

Havet, Frédéric ; Mazauric, Dorian ; Nguyen, Viet-Ha.
Discrete Applied Mathematics. 319 (2022) - p. 394-406 , 2022

Link: https://doi.org/10.1016/..

6

On the inversion number of oriented graphs:

Bang-Jensen, Jørgen ; da Silva, Jonas Costa Ferreira ; Havet, Frédéric
Discrete Mathematics & Theoretical Computer Science. 23 no. 2,special issue (2022) Special issues - p. , 2022

Link: https://doi.org/10.46298..

7

On the Nash number and the diminishing Grundy number of a g..:

Havet, Frédéric ; Ibiapina, Allen ; Rocha, Leonardo
Discrete Applied Mathematics. 314 (2022) - p. 1-16 , 2022

Link: https://doi.org/10.1016/..

8

On the Dichromatic Number of Surfaces:

, In: Trends in Mathematics; Extended Abstracts EuroComb 2021,

Aboulker, Pierre ; Havet, Frédéric ; Knauer, Kolja. - p. 181-187 , 2021

Link: https://doi.org/10.1007/..

9

On the unavoidability of oriented trees:

Dross, François ; Havet, Frédéric
Journal of Combinatorial Theory, Series B. 151 (2021) - p. 83-110 , 2021

Link: https://doi.org/10.1016/..

10

Arc‐disjoint in‐ and out‐branchings in digraphs of independ..:

Bang‐Jensen, Jørgen ; Bessy, Stéphane ; Havet, Frédéric.
Journal of Graph Theory. 100 (2021) 2 - p. 294-314 , 2021

Link: https://doi.org/10.1002/..

11

On the semi-proper orientations of graphs:

Dehghan, Ali ; Havet, Frédéric
Discrete Applied Mathematics. 296 (2021) - p. 9-25 , 2021

Link: https://doi.org/10.1016/..

12

Powers of paths in tournaments:

Draganić, Nemanja ; Dross, François ; Fox, Jacob...
Combinatorics, Probability and Computing. 30 (2021) 6 - p. 894-898 , 2021

Link: https://doi.org/10.1017/..

13

Corrigendum to "Bisimplicial vertices in even-hole-free gra..:

Addario-Berry, Louigi ; Chudnovsky, Maria ; Havet, Frédéric..
Journal of Combinatorial Theory, Series B. 142 (2020) - p. 374-375 , 2020

Link: https://doi.org/10.1016/..

14

Overlaying a Hypergraph with a Graph with Bounded Maximum D..:

, In: Algorithms and Discrete Applied Mathematics; Lecture Notes in Computer Science,

Havet, Frédéric ; Mazauric, Dorian ; Nguyen, Viet-Ha. - p. 403-414 , 2020

Link: https://doi.org/10.1007/..

15

On the Unavoidability of Oriented Trees:

Dross, François ; Havet, Frédéric
Electronic Notes in Theoretical Computer Science. 346 (2019) - p. 425-436 , 2019

Link: https://doi.org/10.1016/..