|
|
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
Journal articles
lirmm-02010775v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Large induced forests in planar graphs with girth 4
François Dross
,
Mickaël Montassier
,
Alexandre Pinlou
Journal articles
lirmm-02021020v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Colouring Diamond-free Graphs
Konrad K. Dabrowski
,
François Dross
,
Daniël Paulusma
Conference papers
lirmm-01481433v1
|
Share
Gmail
Facebook
Twitter
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
Reports
hal-02053265v3
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
Konrad K. Dabrowski
,
François Dross
,
Matthew Johnson
,
Daniël Paulusma
Conference papers
lirmm-01481412v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Decomposing degenerate graphs into locally irregular subgraphs
Julien Bensmail
,
François Dross
,
Nicolas Nisse
Journal articles
hal-02090804v3
|
Share
Gmail
Facebook
Twitter
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
Journal articles
lirmm-01375448v1
|
Share
Gmail
Facebook
Twitter
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
Journal articles
lirmm-01430784v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
On the Unavoidability of Oriented Trees
François Dross
,
Frédéric Havet
Journal articles
hal-02350215v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Computing Small Pivot-Minors
Konrad K. Dabrowski
,
François Dross
,
Jisu Jeong
,
Mamadou Moustapha Kanté
,
O-Joung Kwon
,
et al.
Conference papers
hal-02083512v1
|
Share
Gmail
Facebook
Twitter
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
Conference papers
lirmm-01430813v1
|
Share
Gmail
Facebook
Twitter
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⟩
Conference papers
lirmm-01233461v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Vertex partition of sparse graphs
François Dross
Theses
tel-01882331v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Colouring diamond-free graphs
Konrad K. Dabrowski
,
François Dross
,
Daniël Paulusma
Journal articles
lirmm-01925569v1
|
Share
Gmail
Facebook
Twitter
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⟩
Journal articles
lirmm-01730269v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Fractional Triangle Decompositions in Graphs with Large Minimum Degree
François Dross
Journal articles
lirmm-01336680v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Jones' Conjecture in subcubic graphs
Marthe Bonamy
,
François Dross
,
Tomáš Masařík
,
Wojciech Nadara
,
Marcin Pilipczuk
,
et al.
2019
Preprints, Working Papers, ...
hal-02402899v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
From light edges to strong edge-colouring of 1-planar graphs
Julien Bensmail
,
François Dross
,
Hervé Hocquard
,
Eric Sopena
Journal articles
hal-02112188v3
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Complexity of planar signed graph homomorphisms to cycles
François Dross
,
Florent Foucaud
,
Valia Mitsou
,
Pascal Ochem
,
Théo Pierron
Journal articles
hal-02990576v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Partitioning sparse graphs into an independent set and a graph with bounded size components
Ilkyoo Choi
,
François Dross
,
Pascal Ochem
Journal articles
hal-02990588v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Vertex partitions of ($C 3 , C 4 , C 6$) -free planar graphs
François Dross
,
Pascal Ochem
Journal articles
hal-02990467v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|