I agree that this site is using cookies. You can find further informations here.
X
Raspaud, André
186  results:
Search for persons X
?
1

An (F3,F5)-partition of planar graphs with girth at least 5:

Chen, Min ; Raspaud, André ; Wang, Weifan.
Discrete Mathematics.  346 (2023)  2 - p. 113216 , 2023
Link: https://doi.org/10.1016/..
 
?
2

An (F1,F4)‐partition of graphs with low genus and girth at ..:

Chen, Min ; Raspaud, André ; Yu, Weiqiang
Journal of Graph Theory.  99 (2021)  2 - p. 186-206 , 2021
Link: https://doi.org/10.1002/..
 
?
3

On star edge colorings of bipartite and subcubic graphs:

Casselgren, Carl Johan ; Granholm, Jonas B. ; Raspaud, André
Discrete Applied Mathematics.  298 (2021)  - p. 21-33 , 2021
Link: https://doi.org/10.1016/..
 
?
4

Injective edge-coloring of graphs with given maximum degree:

Kostochka, Alexandr ; Raspaud, André ; Xu, Jingwei
European Journal of Combinatorics.  96 (2021)  - p. 103355 , 2021
Link: https://doi.org/10.1016/..
 
?
5

Choosability with separation of planar graphs without presc..:

Chen, Min ; Fan, Yingying ; Raspaud, André..
Applied Mathematics and Computation.  367 (2020)  - p. 124756 , 2020
Link: https://doi.org/10.1016/..
 
?
6

Cut-Edges and Regular Factors in Regular Graphs of Odd Degr..:

Kostochka, Alexandr V. ; Raspaud, André ; Toft, Bjarne..
Graphs and Combinatorics.  37 (2020)  1 - p. 199-207 , 2020
Link: https://doi.org/10.1007/..
 
?
7

Acyclic improper choosability of subcubic graphs:

Chen, Min ; Raspaud, André
Applied Mathematics and Computation.  356 (2019)  - p. 92-98 , 2019
Link: https://doi.org/10.1016/..
 
?
8

List star edge-coloring of k-degenerate graphs and K4-minor..:

Kerdjoudj, Samia ; Raspaud, André
Discrete Applied Mathematics.  261 (2019)  - p. 268-275 , 2019
Link: https://doi.org/10.1016/..
 
?
9

Strong edge-colorings of sparse graphs with large maximum d..:

Choi, Ilkyoo ; Kim, Jaehoon ; Kostochka, Alexandr V..
European Journal of Combinatorics.  67 (2018)  - p. 21-39 , 2018
Link: https://doi.org/10.1016/..
 
?
10

List star edge coloring of sparse graphs:

Kerdjoudj, Samia ; Raspaud, André
Discrete Applied Mathematics.  238 (2018)  - p. 115-125 , 2018
Link: https://doi.org/10.1016/..
 
?
11

List star chromatic index of sparse graphs:

Kerdjoudj, Samia ; Pradeep, Kavita ; Raspaud, André
Discrete Mathematics.  341 (2018)  7 - p. 1835-1849 , 2018
Link: https://doi.org/10.1016/..
 
?
12

Incidence coloring of graphs with high maximum average degr..:

Bonamy, Marthe ; Hocquard, Hervé ; Kerdjoudj, Samia.
Discrete Applied Mathematics.  227 (2017)  - p. 29-43 , 2017
Link: https://doi.org/10.1016/..
 
?
13

On weight choosabilities of graphs with bounded maximum ave..:

Przybyło, Jakub ; Raspaud, André ; Woźniak, Mariusz
Discrete Applied Mathematics.  217 (2017)  - p. 663-672 , 2017
Link: https://doi.org/10.1016/..
 
?
14

A $$(3,1)^{*}$$ ( 3 , 1 ) ∗ -choosable theorem on planar gr..:

Chen, Min ; Raspaud, André ; Wang, Weifan
Journal of Combinatorial Optimization.  32 (2015)  3 - p. 927-940 , 2015
Link: https://doi.org/10.1007/..
 
?
15

Circuit Covers of Signed Graphs:

Máčajová, Edita ; Raspaud, André ; Rollová, Edita.
Journal of Graph Theory.  81 (2015)  2 - p. 120-133 , 2015
Link: https://doi.org/10.1002/..
 
1-15