Остановите войну!
for scientists:
default search action
André Raspaud
- > Home > Persons > André Raspaud
Publications
- 2023
- [j132]Min Chen, André Raspaud, Weifan Wang, Weiqiang Yu:
An (F3, F5)-partition of planar graphs with girth at least 5. Discret. Math. 346(2): 113216 (2023) - 2022
- [j130]Min Chen, André Raspaud, Weiqiang Yu:
An ( F 1 , F 4 ) -partition of graphs with low genus and girth at least 6. J. Graph Theory 99(2): 186-206 (2022) - 2020
- [j126]Min Chen, Yingying Fan, André Raspaud, Wai Chee Shiu, Weifan Wang:
Choosability with separation of planar graphs without prescribed cycles. Appl. Math. Comput. 367 (2020) - 2019
- [j125]Min Chen, André Raspaud:
Acyclic improper choosability of subcubic graphs. Appl. Math. Comput. 356: 92-98 (2019) - 2016
- [j115]Min Chen, André Raspaud, Weifan Wang:
A (3, 1) ∗-choosable theorem on planar graphs. J. Comb. Optim. 32(3): 927-940 (2016) - 2014
- [j112]Min Chen, André Raspaud:
On (3, 2)*-choosability of planar graphs without adjacent short cycles. Discret. Appl. Math. 162: 159-166 (2014) - [j109]Min Chen, André Raspaud, Weifan Wang:
Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable. Graphs Comb. 30(4): 861-874 (2014) - [j108]Min Chen, André Raspaud, Weifan Wang:
Star list chromatic number of planar subcubic graphs. J. Comb. Optim. 27(3): 440-450 (2014) - 2013
- [j106]Min Chen, André Raspaud:
Planar graphs without 4- and 5-cycles are acyclically 4-choosable. Discret. Appl. Math. 161(7-8): 921-931 (2013) - [j103]Min Chen, André Raspaud:
(3, 1)*-choosability of planar graphs without adjacent short cycles. Electron. Notes Discret. Math. 43: 221-226 (2013) - [j101]Min Chen, André Raspaud, Weifan Wang:
6-Star-Coloring of Subcubic Graphs. J. Graph Theory 72(2): 128-145 (2013) - 2012
- [j96]Min Chen, Mickaël Montassier, André Raspaud:
Some structural properties of planar graphs and their applications to 3-choosability. Discret. Math. 312(2): 362-373 (2012) - [j92]Min Chen, André Raspaud, Weifan Wang:
Vertex-arboricity of planar graphs without intersecting triangles. Eur. J. Comb. 33(5): 905-923 (2012) - [j90]Min Chen, Gena Hahn, André Raspaud, Weifan Wang:
Some results on the injective chromatic number of graphs. J. Comb. Optim. 24(3): 299-318 (2012) - [j88]Min Chen, André Raspaud:
A sufficient condition for planar graphs to be acyclically 5-choosable. J. Graph Theory 70(2): 135-151 (2012) - 2011
- [j86]Min Chen, André Raspaud, Nicolas Roussel, Xuding Zhu:
Acyclic 4-choosability of planar graphs. Discret. Math. 311(1): 92-101 (2011) - [j84]Min Chen, André Raspaud, Weifan Wang:
8-star-choosability of a graph with maximum average degree less than 3. Discret. Math. Theor. Comput. Sci. 13(3): 97-110 (2011) - 2010
- [j73]Min Chen, André Raspaud:
On acyclic 4-choosability of planar graphs without short cycles. Discret. Math. 310(15-16): 2113-2118 (2010) - [j72]Oleg V. Borodin, Min Chen, Anna O. Ivanova, André Raspaud:
Acyclic 3-choosability of sparse graphs with girth at least 7. Discret. Math. 310(17-18): 2426-2434 (2010) - [j70]Min Chen, André Raspaud:
Homomorphisms from sparse graphs to the Petersen graph. Discret. Math. 310(20): 2705-2713 (2010) - 2009
- [j55]Min Chen, André Raspaud:
Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable. Electron. Notes Discret. Math. 34: 659-667 (2009) - 2007
- [j42]Min Chen, André Raspaud, Weifan Wang:
Three-coloring planar graphs without short cycles. Inf. Process. Lett. 101(3): 134-138 (2007)
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-04-21 18:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint