I agree that this site is using cookies. You can find further informations here.
X
Dross, François
118  results:
Search for persons X
?
1

The Complexity of Two Colouring Games:

Andres, Stephan Dominique ; Dross, François ; Huggan, Melissa A...
Algorithmica.  85 (2022)  4 - p. 1067-1090 , 2022
Link: https://doi.org/10.1007/..
 
?
2

Generalising the achromatic number to Zaslavsky's colouring..:

Bensmail, Julien ; Dross, François ; Oijid, Nacim.
Theoretical Computer Science.  923 (2022)  - p. 196-221 , 2022
Link: https://doi.org/10.1016/..
 
?
3

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/..
 
?
4

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/..
 
?
5

Tree Pivot-Minors and Linear Rank-Width:

Dabrowski, Konrad K. ; Dross, François ; Jeong, Jisu...
SIAM Journal on Discrete Mathematics.  35 (2021)  4 - p. 2922-2945 , 2021
Link: https://doi.org/10.1137/..
 
?
6

Decomposing Degenerate Graphs into Locally Irregular Subgra..:

Bensmail, Julien ; Dross, François ; Nisse, Nicolas
Graphs and Combinatorics.  36 (2020)  6 - p. 1869-1889 , 2020
Link: https://doi.org/10.1007/..
 
?
7

Maximal Wiener index for graphs with prescribed number of b..:

Bessy, Stéphane ; Dross, François ; Hriňáková, Katarína..
Applied Mathematics and Computation.  380 (2020)  - p. 125274 , 2020
Link: https://doi.org/10.1016/..
 
?
8

Complexity of planar signed graph homomorphisms to cycles:

Dross, François ; Foucaud, Florent ; Mitsou, Valia..
Discrete Applied Mathematics.  284 (2020)  - p. 166-178 , 2020
Link: https://doi.org/10.1016/..
 
?
9

Graphs with the second and third maximum Wiener indices ove..:

Bessy, Stéphane ; Dross, François ; Knor, Martin.
Discrete Applied Mathematics.  284 (2020)  - p. 195-200 , 2020
Link: https://doi.org/10.1016/..
 
?
10

Partitioning sparse graphs into an independent set and a gr..:

Choi, Ilkyoo ; Dross, François ; Ochem, Pascal
Discrete Mathematics.  343 (2020)  8 - p. 111921 , 2020
Link: https://doi.org/10.1016/..
 
?
11

Filling the complexity gaps for colouring planar and bounde..:

Dabrowski, Konrad K. ; Dross, François ; Johnson, Matthew.
Journal of Graph Theory.  92 (2019)  4 - p. 377-393 , 2019
Link: https://doi.org/10.1002/..
 
?
12

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/..
 
?
13

Vertex partitions of (C3,C4,C6)-free planar graphs:

Dross, François ; Ochem, Pascal
Discrete Mathematics.  342 (2019)  11 - p. 3229-3236 , 2019
Link: https://doi.org/10.1016/..
 
?
14

The structure of graphs with given number of blocks and the..:

Bessy, Stéphane ; Dross, François ; Hriňáková, Katarína..
Journal of Combinatorial Optimization.  39 (2019)  1 - p. 170-184 , 2019
Link: https://doi.org/10.1007/..
 
?
15

Note on 3-choosability of planar graphs with maximum degree..:

Dross, François ; Lužar, Borut ; Maceková, Mária.
Discrete Mathematics.  342 (2019)  11 - p. 3123-3129 , 2019
Link: https://doi.org/10.1016/..
 
1-15