Recherche - Archive ouverte HAL

Document
13
Notice
8

rapport de recherche
1

Informatique [cs]
19
Mathématiques [math]
9

2021
1
2020
4
2019
5
2018
3
2017
2
2016
5
2015
1

anglais
21

		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	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Colouring Diamond-free Graphs Konrad K. Dabrowski , François Dross , Daniël Paulusma SWAT: Scandinavian Workshops on Algorithm Theory, 2016, Reykjavik, Iceland. pp.16:1--16:14, ⟨10.4230/LIPIcs.SWAT.2016.16⟩ Communication dans un congrès lirmm-01481433v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé 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 Discrete Applied Mathematics, 2016, 214, pp.99-107. ⟨10.1016/j.dam.2016.06.011⟩ Article dans une revue lirmm-01375448v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Decomposing degenerate graphs into locally irregular subgraphs Julien Bensmail , François Dross , Nicolas Nisse Graphs and Combinatorics, 2020, 36 (6), pp.1869-1889. ⟨10.1007/s00373-020-02193-6⟩ Article dans une revue hal-02090804v3	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé 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 25th International Workshop on Combinatorial Algorithms (IWOCA), Oct 2015, Verona, Italy. pp.100-111, ⟨10.1007/978-3-319-29516-9_9⟩ Communication dans un congrès lirmm-01481412v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé 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 European Journal of Combinatorics, 2017, 66, pp.81-94. ⟨10.1016/j.ejc.2017.06.014⟩ Article dans une revue lirmm-01430784v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		On the Unavoidability of Oriented Trees François Dross , Frédéric Havet Electronic Notes in Theoretical Computer Science, 2019, 346, pp.425-436. ⟨10.1016/j.entcs.2019.08.038⟩ Article dans une revue hal-02350215v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		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 Discrete Mathematics, 2019, 342 (4), pp.943-950. ⟨10.1016/j.disc.2018.11.023⟩ Article dans une revue lirmm-02010775v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Large induced forests in planar graphs with girth 4 François Dross , Mickaël Montassier , Alexandre Pinlou Discrete Applied Mathematics, 2019, 254, pp.96-106. ⟨10.1016/j.dam.2018.06.029⟩ Article dans une revue lirmm-02021020v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé 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	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé 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	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé 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	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Colouring diamond-free graphs Konrad K. Dabrowski , François Dross , Daniël Paulusma Journal of Computer and System Sciences, 2017, 89, pp.410-431. ⟨10.1016/j.jcss.2017.06.005⟩ Article dans une revue lirmm-01925569v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Vertex partition of sparse graphs François Dross Other [cs.OH]. Université Montpellier, 2018. English. ⟨NNT : 2018MONTS011⟩ Thèse tel-01882331v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé 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	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé 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	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé 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 Discrete Mathematics and Theoretical Computer Science, 2020, vol. 22 no. 1 (2), ⟨10.23638/DMTCS-22-1-2⟩ Article dans une revue hal-02112188v3	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Vertex partitions of ($C 3 , C 4 , C 6$) -free planar graphs François Dross , Pascal Ochem Discrete Mathematics, 2019, 342 (11), pp.3229-3236. ⟨10.1016/j.disc.2019.07.002⟩ Article dans une revue hal-02990467v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé 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 Discrete Mathematics, 2020, 343 (8), pp.111921. ⟨10.1016/j.disc.2020.111921⟩ Article dans une revue hal-02990588v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé 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 Discrete Applied Mathematics, 2020, 284, pp.166-178. ⟨10.1016/j.dam.2020.03.029⟩ Article dans une revue hal-02990576v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Fractional Triangle Decompositions in Graphs with Large Minimum Degree François Dross SIAM Journal on Discrete Mathematics, 2016, 30 (1), pp.36-42. ⟨10.1137/15M1014310⟩ Article dans une revue lirmm-01336680v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More

Filtrer vos résultats

The Complexity of two Colouring Games

Colouring Diamond-free Graphs

A lower bound on the order of the largest induced forest in planar graphs with high girth

Decomposing degenerate graphs into locally irregular subgraphs

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs

Partitioning a triangle-free planar graph into a forest and a forest of bounded degree

On the Unavoidability of Oriented Trees

A lower bound on the order of the largest induced linear forest in triangle-free planar graphs

Large induced forests in planar graphs with girth 4

Partitioning sparse graphs into an independent set and a forest of bounded degree

Computing Small Pivot-Minors

Partitioning a triangle-free planar graph into a forest and a forest of bounded degree

Colouring diamond-free graphs

Vertex partition of sparse graphs

Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree

Jones' Conjecture in subcubic graphs

From light edges to strong edge-colouring of 1-planar graphs

Vertex partitions of ($C 3 , C 4 , C 6$) -free planar graphs

Partitioning sparse graphs into an independent set and a graph with bounded size components

Complexity of planar signed graph homomorphisms to cycles

Fractional Triangle Decompositions in Graphs with Large Minimum Degree