A lower bound on the order of the largest induced linear forest in triangle-free planar graphs
François Dross
,
Mickaël Montassier
,
Alexandre Pinlou
Article dans une revue
lirmm-02010775v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Large induced forests in planar graphs with girth 4
François Dross
,
Mickaël Montassier
,
Alexandre Pinlou
Article dans une revue
lirmm-02021020v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
François Dross
,
Mickaël Montassier
,
Alexandre Pinlou
Article dans une revue
lirmm-01430784v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
On the Unavoidability of Oriented Trees
François Dross
,
Frédéric Havet
Article dans une revue
hal-02350215v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
The Complexity of two Colouring Games
Stephan Dominique Andres
,
François Dross
,
Melissa Huggan
,
Fionn Mc Inerney
,
Richard J Nowakowski
[Research Report] CISPA Helmholtz Center for Information Security, Saarbrücken, Germany. 2021
Rapport
hal-02053265v3
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Colouring Diamond-free Graphs
Konrad K. Dabrowski
,
François Dross
,
Daniël Paulusma
Communication dans un congrès
lirmm-01481433v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
A lower bound on the order of the largest induced forest in planar graphs with high girth
François Dross
,
Mickaël Montassier
,
Alexandre Pinlou
Article dans une revue
lirmm-01375448v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Decomposing degenerate graphs into locally irregular subgraphs
Julien Bensmail
,
François Dross
,
Nicolas Nisse
Article dans une revue
hal-02090804v3
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
Konrad K. Dabrowski
,
François Dross
,
Matthew Johnson
,
Daniël Paulusma
Communication dans un congrès
lirmm-01481412v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Partitioning sparse graphs into an independent set and a forest of bounded degree
François Dross
,
Mickaël Montassier
,
Alexandre Pinlou
BGW: Bordeaux Graph Workshop , Nov 2016, Bordeaux, France
Communication dans un congrès
lirmm-01430813v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
François Dross
,
Mickaël Montassier
,
Alexandre Pinlou
EuroComb: European Conference on Combinatorics, Graph Theory and Applications , Aug 2015, Bergen, Norway. pp.269-275,
⟨10.1016/j.endm.2015.06.037⟩
Communication dans un congrès
lirmm-01233461v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Computing Small Pivot-Minors
Konrad K. Dabrowski
,
François Dross
,
Jisu Jeong
,
Mamadou Moustapha Kanté
,
O-Joung Kwon
,
et al.
WG 2018 - 44th International Workshop on Graph-Theoretic Concepts in Computer Science , Jun 2018, Cottbus, Germany. pp.125-138,
⟨10.1007/978-3-030-00256-5_11⟩
Communication dans un congrès
hal-02083512v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Vertex partition of sparse graphs
François Dross
Thèse
tel-01882331v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Colouring diamond-free graphs
Konrad K. Dabrowski
,
François Dross
,
Daniël Paulusma
Article dans une revue
lirmm-01925569v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
From light edges to strong edge-colouring of 1-planar graphs
Julien Bensmail
,
François Dross
,
Hervé Hocquard
,
Eric Sopena
Article dans une revue
hal-02112188v3
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Complexity of planar signed graph homomorphisms to cycles
François Dross
,
Florent Foucaud
,
Valia Mitsou
,
Pascal Ochem
,
Théo Pierron
Article dans une revue
hal-02990576v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Vertex partitions of ($C 3 , C 4 , C 6$) -free planar graphs
François Dross
,
Pascal Ochem
Article dans une revue
hal-02990467v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Partitioning sparse graphs into an independent set and a graph with bounded size components
Ilkyoo Choi
,
François Dross
,
Pascal Ochem
Article dans une revue
hal-02990588v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Jones' Conjecture in subcubic graphs
Marthe Bonamy
,
François Dross
,
Tomáš Masařík
,
Wojciech Nadara
,
Marcin Pilipczuk
,
et al.
2019
Pré-publication, Document de travail
hal-02402899v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree
François Dross
,
Mickaël Montassier
,
Alexandre Pinlou
The Electronic Journal of Combinatorics , 2018, 25 (1), pp.#P1.45.
⟨10.37236/6815⟩
Article dans une revue
lirmm-01730269v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Fractional Triangle Decompositions in Graphs with Large Minimum Degree
François Dross
Article dans une revue
lirmm-01336680v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More