default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan Narboni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j8]Marthe Bonamy, Marc Heinrich, Clément Legrand-Duchesne
, Jonathan Narboni:
On a recolouring version of Hadwiger's conjecture. J. Comb. Theory B 164: 364-370 (2024)- 2023
- [j7]Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron:
A Note on the Flip Distance between Non-crossing Spanning Trees. Comput. Geom. Topol. 2(1): 8:1-8:7 (2023) - [j6]Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni:
On Vizing's edge colouring question. J. Comb. Theory B 159: 126-139 (2023) - [j5]Frantisek Kardos, Jonathan Narboni, Reza Naserasr, Zhouningxin Wang:
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs. SIAM J. Discret. Math. 37(2): 1198-1211 (2023) - [j4]Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond:
A lower bound for constant-size local certification. Theor. Comput. Sci. 971: 114068 (2023) - 2021
- [j3]Valentin Bartier, Laurine Bénéteau, Marthe Bonamy, Hoang La, Jonathan Narboni:
A note on deterministic zombies. Discret. Appl. Math. 301: 65-68 (2021) - [j2]Marthe Bonamy, Carla Groenland, Carole Muller, Jonathan Narboni, Jakub Pekárek, Alexandra Wesolek:
A note on connected greedy edge colouring. Discret. Appl. Math. 304: 129-136 (2021) - [j1]Frantisek Kardos, Jonathan Narboni:
On the 4-color theorem for signed graphs. Eur. J. Comb. 91: 103215 (2021)
Conference and Workshop Papers
- 2022
- [c1]Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond:
Lower Bound for Constant-Size Local Certification. SSS 2022: 239-253
Informal and Other Publications
- 2023
- [i7]Jonathan Narboni:
Vizing's edge-recoloring conjecture holds. CoRR abs/2302.12914 (2023) - [i6]Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron:
A note on the flip distance between non-crossing spanning trees. CoRR abs/2303.07710 (2023) - [i5]Lech Duraj, Ross J. Kang, Hoang La, Jonathan Narboni, Filip Pokrývka, Clément Rambaud, Amadeus Reinald:
The χ-binding function of d-directional segment graphs. CoRR abs/2309.06072 (2023) - 2022
- [i4]Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond:
Lower bound for constant-size local certification. CoRR abs/2208.14229 (2022) - 2021
- [i3]Marthe Bonamy, Marc Heinrich, Clément Legrand-Duchesne, Jonathan Narboni:
On a recolouring version of Hadwiger's conjecture. CoRR abs/2103.10684 (2021) - [i2]Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni:
On Vizing's edge colouring question. CoRR abs/2107.07900 (2021) - 2020
- [i1]Valentin Bartier, Laurine Bénéteau, Marthe Bonamy, Hoang La, Jonathan Narboni:
A note on deterministic zombies. CoRR abs/2008.03587 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
