Publications of François Dross
BACK TO COATI PUBLICATION INDEXPublications of François Dross
| Articles in journal or book's chapters |
-
Nemanja Draganic,
François Dross,
Jacob Fox,
António Girão,
Frédéric Havet,
Dániel Korándi,
William Lochet,
David Munhá Correia,
Alex Scott,
and Benny Sudakov.
Powers of paths in tournaments.
Combinatorics, Probability and Computing,
pp 1-5,
2021.
[WWW
] [PDF
] [bibtex-entry]
-
François Dross and Frédéric Havet.
On the unavoidability of oriented trees.
Journal of Combinatorial Theory, Series B,
151:83-110,
November 2021.
[WWW
] [PDF
]
Keywords: Tournament, Oriented tree, Unavoidable. [bibtex-entry]
-
Julien Bensmail,
François Dross,
Hervé Hocquard,
and Eric Sopena.
From light edges to strong edge-colouring of 1-planar graphs.
Discrete Mathematics and Theoretical Computer Science,
vol. 22 no. 1(2),
January 2020.
[WWW
] [PDF
]
Keywords: 1-planar graphs, Light edges, Strong edge-colouring, Strong chromatic index. [bibtex-entry]
-
Julien Bensmail,
François Dross,
and Nicolas Nisse.
Decomposing degenerate graphs into locally irregular subgraphs.
Graphs and Combinatorics,
36(6):1869--1889,
2020.
[WWW
] [PDF
]
Keywords: planar graphs, k-trees, locally irregular decompositions, degenerate graphs, cacti. [bibtex-entry]
-
François Dross and Frédéric Havet.
On the Unavoidability of Oriented Trees.
Electronic Notes in Theoretical Computer Science,
346:425-436,
August 2019.
[WWW
] [PDF
]
Keywords: Tournament, oriented trees, unavoidability, Ramsey theory. [bibtex-entry]
| Internal reports |
-
Julien Bensmail,
François Dross,
Nacim Oijid,
and Éric Sopena.
Generalising the achromatic number to Zaslavsky's colourings of signed graphs.
Research Report,
Université côte d'azur ; Université de Bordeaux ; Université lyon 1,
2021.
[WWW
] [PDF
]
Keywords: chromatic number, achromatic number, complete colouring, Zaslavsky's colouring, signed graph. [bibtex-entry]
-
Stephan Dominique Andres,
François Dross,
Melissa Huggan,
Fionn Mc Inerney,
and Richard J Nowakowski.
On the Complexity of Orthogonal Colouring Games and the NP-Completeness of Recognising Graphs Admitting a Strictly Matched Involution.
Research Report,
Inria - Sophia Antipolis,
March 2019.
[WWW
] [PDF
]
Keywords: scoring game, strictly matched involution, NP-completeness, combinatorial game, Orthogonal Colouring Game, orthogonal graph colouring, PSPACE-completeness. [bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:44 2022