Seguir
Arnaud Pêcher
Arnaud Pêcher
Professor of Computer Science, University of Bordeaux
E-mail confirmado em u-bordeaux.fr - Página inicial
Título
Citado por
Citado por
Ano
Strong chromatic index of planar graphs with large girth
GJ Chang, M Montassier, A Pêche, A Raspaud
Discussiones Mathematicae Graph Theory 34 (4), 723-733, 2014
292014
Almost all webs are not rank-perfect
A Pêcher, AK Wagler
Mathematical programming 105, 311-328, 2006
242006
Decomposition of sparse graphs, with application to game coloring number
M Montassier, A Pêcher, A Raspaud, DB West, X Zhu
Discrete Mathematics 310 (10-11), 1520-1523, 2010
152010
On classes of minimal circular-imperfect graphs
A Pêcher, AK Wagler
Discrete Applied Mathematics 156 (7), 998-1010, 2008
152008
On the theta number of powers of cycle graphs
C Bachoc, A Pêcher, A Thiéry
Combinatorica 33, 297-317, 2013
142013
Clique and chromatic number of circular-perfect graphs
A Pêcher, AK Wagler
Electronic Notes in Discrete Mathematics 36, 199-206, 2010
142010
Triangle-free strongly circular-perfect graphs
S Coulonges, A Pêcher, AK Wagler
Discrete mathematics 309 (11), 3632-3643, 2009
132009
A construction for non-rank facets of stable set polytopes of webs
A Pêcher, AK Wagler
European Journal of Combinatorics 27 (7), 1172-1185, 2006
112006
Three classes of minimal circular-imperfect graphs
A Pêcher, AK Wagler, X Zhu
Electronic Notes in Discrete Mathematics, 9-15, 2005
112005
On the density of sets of the Euclidean plane avoiding distance 1
T Bellitto, A Pêcher, A Sédillot
Discrete Mathematics & Theoretical Computer Science 23 (Combinatorics), 2021
102021
Computing clique and chromatic number of circular-perfect graphs in polynomial time
A Pêcher, AK Wagler
Mathematical Programming 141 (1), 121-133, 2013
102013
Characterizing and bounding the imperfection ratio for some classes of graphs
S Coulonges, A Pêcher, AK Wagler
Mathematical programming 118 (1), 37-46, 2009
102009
On facets of stable set polytopes of claw-free graphs with stability number 3
A Pêcher, AK Wagler
Discrete Mathematics 310 (3), 493-498, 2010
72010
On the density of sets avoiding parallelohedron distance 1
C Bachoc, T Bellitto, P Moustrou, A Pêcher
Discrete & Computational Geometry 62 (3), 497-524, 2019
62019
On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs
A Pêcher, AK Wagler
Electronic Notes in Discrete Mathematics 35, 53-58, 2009
62009
On the circular chromatic number of circular partitionable graphs
A Pêcher, X Zhu
Journal of Graph Theory 52 (4), 294-306, 2006
62006
On facets of stable set polytope of claw-free graphs with maximum stable set size three
A Pêcher, P Pesneau, A Wagler
Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory …, 2006
62006
A conjecture on the stable set polytope for claw-free graphs
A Pêcher, A Wagler
preprint, 11-2006, 0
6
Claw‐free circular‐perfect graphs
A Pêcher, X Zhu
Journal of Graph Theory 65 (2), 163-172, 2010
52010
MPQ-trees for orthogonal packing problem
C Joncour, A Pêcher, P Valicov
Electronic Notes in Discrete Mathematics 36, 423-429, 2010
52010
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20