François Dross

Available identifiers

zbMath Open dross.francoisMaRDI QIDQ317408

List of research outcomes

Publication	Date of Publication	Type
Computing pivot-minors	2023-11-08	Paper
The complexity of two colouring games	2023-04-11	Paper
Powers of paths in tournaments	2023-03-30	Paper
Separating the edges of a graph by a linear number of paths	2023-01-20	Paper
Generalising the achromatic number to Zaslavsky's colourings of signed graphs	2022-06-13	Paper
On the unavoidability of oriented trees	2022-04-27	Paper
Tree Pivot-Minors and Linear Rank-Width	2022-01-07	Paper
Jones' conjecture in subcubic graphs	2021-10-26	Paper
Generalising the achromatic number to Zaslavsky's colourings of signed graphs	2021-09-28	Paper
On the unavoidability of oriented trees	2021-09-16	Paper
Decomposing degenerate graphs into locally irregular subgraphs	2021-03-17	Paper
https://portal.mardi4nfdi.de/entity/Q5130733	2020-10-28	Paper
Filling the complexity gaps for colouring planar and bounded degree graphs	2020-07-17	Paper
Complexity of planar signed graph homomorphisms to cycles	2020-07-07	Paper
Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs	2020-07-07	Paper
Partitioning sparse graphs into an independent set and a graph with bounded size components	2020-06-08	Paper
Maximal Wiener index for graphs with prescribed number of blocks	2020-05-14	Paper
The structure of graphs with given number of blocks and the maximum Wiener index	2020-02-03	Paper
1-planar graphs with minimum degree at least 3 have bounded girth	2020-01-15	Paper
Note on 3-choosability of planar graphs with maximum degree 4	2019-09-11	Paper
Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs	2019-09-11	Paper
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs	2019-02-20	Paper
Large induced forests in planar graphs with girth 4	2019-02-08	Paper
Computing small pivot-minors	2018-11-22	Paper
Partitioning sparse graphs into an independent set and a forest of bounded degree	2018-05-25	Paper
https://portal.mardi4nfdi.de/entity/Q5369518	2017-10-17	Paper
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree	2017-09-11	Paper
Colouring diamond-free graphs	2017-09-07	Paper
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree	2016-10-14	Paper
A lower bound on the order of the largest induced forest in planar graphs with high girth	2016-09-30	Paper
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs	2016-04-04	Paper
Fractional Triangle Decompositions in Graphs with Large Minimum Degree	2016-01-15	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: François Dross