Recherche - Archive ouverte HAL

80 résultats

	Pour les 80 documents Envoyer sur ORCID RSS ATOM Exporter BibTeX XML-TEI CSV RTF EndNote PDF HTML Export avancé	Page : Page précédente 1 2 3 Page suivante	triés par Pertinence Auteur A→Z Auteur Z→A Titre A→Z Titre Z→A Date de publication croissante Date de publication décroissante Date de dépôt croissante Date de dépôt décroissante

		The Interactive Sum Choice Number of Graphs Marthe Bonamy , Kitty Meeks Electron. Notes Discret. Math., 2017, 61, pp.139--145. ⟨10.1016/j.endm.2017.06.031⟩ Article dans une revue hal-02527074v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Graphs of bounded cliquewidth are polynomially $\chi$-bounded Marthe Bonamy , Michał Pilipczuk 2019 Pré-publication, Document de travail hal-02402904v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy Marthe Bonamy , Nicolas Bousquet , Konrad K. Dabrowski , Matthew Johnson , Daniël Paulusma , et al. 2019 Pré-publication, Document de travail hal-02402919v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Every planar graph with $\Delta\geqslant 8$ is totally $(\Delta+2)$-choosable Marthe Bonamy , Théo Pierron , Eric Sopena 2019 Pré-publication, Document de travail hal-02402914v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Strong edge coloring sparse graphs Julien Bensmail , Marthe Bonamy , Hervé Hocquard Electronic Notes in Discrete Mathematics, 2015, The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015, 49, pp.773-778. ⟨10.1016/j.endm.2015.06.104⟩ Article dans une revue lirmm-01264420v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Distributed Recoloring Marthe Bonamy , Paul Ouvrard , Mikaël Rabie , Jukka Suomela , Jara Uitto 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018, 2018, London, United Kingdom. pp.12:1--12:17, ⟨10.4230/LIPIcs.DISC.2018.12⟩ Communication dans un congrès hal-02527069v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Frozen (Δ + 1)-colourings of bounded degree graphs Marthe Bonamy , Nicolas Bousquet , Guillem Perarnau Combinatorics, Probability and Computing, 2021, 30 (3), pp.330-343. ⟨10.1017/S0963548320000139⟩ Article dans une revue hal-03829750v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Graph Isomorphism for $$(H_1,H_2)$$-Free Graphs: An Almost Complete Dichotomy Nicolas Bousquet , Marthe Bonamy , Konrad Dabrowski , Matthew Johnson , Daniël Paulusma , et al. Algorithmica, 2021, 83 (3), pp.822-852. ⟨10.1007/s00453-020-00747-x⟩ Article dans une revue hal-03394356v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		A 14$k$-Kernel for Planar Feedback Vertex Set via Region Decomposition Marthe Bonamy , Lukasz Kowalik IPEC 2014 - 9th International Symposium on Parameterized and Exact Computation, Sep 2014, Wroclaw, Poland. pp.97-109, ⟨10.1007/978-3-319-13524-3_9⟩ Communication dans un congrès lirmm-01264417v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		On the effect of symmetry requirement for rendezvous on the complete graph Marthe Bonamy , Michał Pilipczuk , Jean-Sébastien Sereni , Richard Weber Mathematics of Operations Research, 2023, 48 (2), pp.942-953. ⟨10.1287/moor.2022.1288⟩ Article dans une revue hal-03797712v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs Marthe Bonamy , Matthew Johnson , Ioannis Lignos , Viresh Patel , Daniël Paulusma Journal of Combinatorial Optimization, 2012, pp.15. ⟨10.1007/s10878-012-9490-y⟩ Article dans une revue lirmm-00782882v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		2-Distance Coloring of Sparse Graphs Marthe Bonamy , Benjamin Lévêque , Alexandre Pinlou Journal of Graph Theory, 2014, 77 (3), pp.190-218. ⟨10.1002/jgt.21782⟩ Article dans une revue lirmm-01233451v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Independent Feedback Vertex Set for P_5-free Graphs Marthe Bonamy , Konrad K. Dabrowski , Carl Feghali , Matthew Johnson , Daniël Paulusma 28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand, 2017, Phuket, Thailand. pp.16:1--16:12, ⟨10.4230/LIPIcs.ISAAC.2017.16⟩ Communication dans un congrès hal-02527077v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Planar graphs of girth at least five are square ($Δ$\unicode8239+\unicode82392)-choosable Marthe Bonamy , Daniel W. Cranston , Luke Postle J. Comb. Theory, Ser. B, 2019, 134, pp.218--238. ⟨10.1016/j.jctb.2018.06.005⟩ Article dans une revue hal-02527062v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Every planar graph with $Δ$$≥q$8 is totally ($Δ$+2)-choosable Marthe Bonamy , Théo Pierron , Eric Sopena CoRR, 2019, abs/1904.12060 Article dans une revue hal-02527065v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Degeneracy of P_t-free and C_{\>= t}-free graphs with no large complete bipartite subgraphs Marthe Bonamy , Nicolas Bousquet , Michał Pilipczuk , Paweł Rzążewski , Stéphan Thomassé , et al. Journal of Combinatorial Theory, Series B, 2022, 152, pp.353-378. ⟨10.1016/j.jctb.2021.10.005⟩ Article dans une revue hal-03829680v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Frozen colourings of bounded degree graphs Marthe Bonamy , Nicolas Bousquet , Guillem Perarnau Electronic Notes in Discrete Mathematics, 2018, 68, pp.167--172. ⟨10.1016/j.endm.2018.06.029⟩ Article dans une revue hal-02527067v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Recoloring graphs via tree decompositions Nicolas Bousquet , Marthe Bonamy European Journal of Combinatorics, 2018, 69, pp.200 - 213. ⟨10.1016/j.ejc.2017.10.010⟩ Article dans une revue hal-01804109v1	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
		2-distance coloring of sparse graphs Marthe Bonamy , Benjamin Lévêque , Alexandre Pinlou Eurocomb'11: European Conference on Combinatorics, Graph Theory and Applications, Aug 2011, Budapest, Hungary. pp.155-160, ⟨10.1016/j.endm.2011.09.027⟩ Communication dans un congrès lirmm-00782852v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Shorter Labeling Schemes for Planar Graphs Marthe Bonamy , Cyril Gavoille , Michał Pilipczuk 2019 Pré-publication, Document de travail hal-02265219v2	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Tight Lower Bounds for the Complexity of Multicoloring Marthe Bonamy , Lukasz Kowalik , Michal Pilipczuk , Arkadiusz Socala , Marcin Wrochna TOCT, 2019, 11 (3), pp.13:1--13:19. ⟨10.1145/3313906⟩ Article dans une revue hal-02527064v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration Marthe Bonamy , Konrad K. Dabrowski , Carl Feghali , Matthew Johnson , Daniël Paulusma CoRR, 2017, abs/1707.09817 Article dans une revue hal-02527083v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		A 13k-kernel for planar feedback vertex set via region decomposition Marthe Bonamy , Lukasz Kowalik Theor. Comput. Sci., 2016, 645, pp.25--40. ⟨10.1016/j.tcs.2016.05.031⟩ Article dans une revue hal-02527084v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants Marthe Bonamy , Oscar Defrain , Marc Heinrich , Michał Pilipczuk , Jean-Florent Raymond ACM Transactions on Algorithms, 2020, 16 (3), pp.1-23. ⟨10.1145/3386686⟩ Article dans une revue hal-03448793v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		On Vizing's edge colouring question Marthe Bonamy , Oscar Defrain , Tereza Klimošová , Aurélie Lagoutte , Jonathan Narboni Journal of Combinatorial Theory, Series B, 2023, 159, pp.126-139. ⟨10.1016/j.jctb.2022.10.005⟩ Article dans une revue hal-04152492v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		On a recolouring version of Hadwiger's conjecture Marthe Bonamy , Marc Heinrich , Clément Legrand-Duchesne , Jonathan Narboni 2021 Pré-publication, Document de travail hal-04097535v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Avoidable paths in graphs Marthe Bonamy , Oscar Defrain , Meike Hatzel , Jocelyn Thiebaut 2020 Pré-publication, Document de travail hal-02402905v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable Marthe Bonamy , Benjamin Lévêque , Alexandre Pinlou Discrete Mathematics, 2014, 317, pp.19-32. ⟨10.1016/j.disc.2013.10.022⟩ Article dans une revue lirmm-01233453v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Recognizing Graphs Close to Bipartite Graphs Marthe Bonamy , Konrad K. Dabrowski , Carl Feghali , Matthew Johnson , Daniël Paulusma 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark, 2017, Aalborg, Denmark. pp.70:1--70:14, ⟨10.4230/LIPIcs.MFCS.2017.70⟩ Communication dans un congrès hal-02527078v1	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 Interactive Sum Choice Number of Graphs

Graphs of bounded cliquewidth are polynomially $\chi$-bounded

Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy

Every planar graph with $\Delta\geqslant 8$ is totally $(\Delta+2)$-choosable

Strong edge coloring sparse graphs

Distributed Recoloring

Frozen (Δ + 1)-colourings of bounded degree graphs

Graph Isomorphism for $$(H_1,H_2)$$-Free Graphs: An Almost Complete Dichotomy

A 14$k$-Kernel for Planar Feedback Vertex Set via Region Decomposition

On the effect of symmetry requirement for rendezvous on the complete graph

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs

2-Distance Coloring of Sparse Graphs

Independent Feedback Vertex Set for P_5-free Graphs

Planar graphs of girth at least five are square (\(Δ\)\unicode8239+\unicode82392)-choosable

Every planar graph with \(Δ\)\(≥q\)8 is totally (\(Δ\)+2)-choosable

Degeneracy of P_t-free and C_{\>= t}-free graphs with no large complete bipartite subgraphs

Frozen colourings of bounded degree graphs

Recoloring graphs via tree decompositions

Jones' Conjecture in subcubic graphs

2-distance coloring of sparse graphs

Shorter Labeling Schemes for Planar Graphs

Tight Lower Bounds for the Complexity of Multicoloring

Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration

A 13k-kernel for planar feedback vertex set via region decomposition

Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants

On Vizing's edge colouring question

On a recolouring version of Hadwiger's conjecture

Avoidable paths in graphs

Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable

Recognizing Graphs Close to Bipartite Graphs