Maria Chudnovsky
Maria Chudnovsky
E-mail confirmado em math.princeton.edu - Página inicial
Título
Citado por
Citado por
Ano
The strong perfect graph theorem
M Chudnovsky, N Robertson, P Seymour, R Thomas
Annals of mathematics, 51-229, 2006
13462006
Recognizing berge graphs
M Chudnovsky, G Cornuéjols, X Liu, P Seymour, K Vušković
Combinatorica 25 (2), 143-186, 2005
3842005
The structure of claw-free graphs.
M Chudnovsky, PD Seymour
Surveys in combinatorics 327, 153-171, 2005
2082005
The roots of the independence polynomial of a clawfree graph
M Chudnovsky, P Seymour
Journal of Combinatorial Theory, Series B 97 (3), 350-357, 2007
1862007
Progress on perfect graphs
M Chudnovsky, N Robertson, PD Seymour, R Thomas
Mathematical Programming 97 (1), 405-422, 2003
1032003
Claw-free graphs. V. Global structure
M Chudnovsky, P Seymour
Journal of Combinatorial Theory, Series B 98 (6), 1373-1410, 2008
882008
Packing Non-Zero A-Paths In Group-Labelled Graphs
M Chudnovsky, J Geelen, B Gerards, L Goddyn, M Lohman, P Seymour
Combinatorica 26 (5), 521-532, 2006
782006
The Erdös–Hajnal conjecture—a survey
M Chudnovsky
Journal of Graph Theory 75 (2), 178-190, 2014
712014
Claw-free graphs. IV. Decomposition theorem
M Chudnovsky, P Seymour
Journal of Combinatorial Theory, Series B 98 (5), 839-938, 2008
712008
Claw-free graphs VI. Colouring
M Chudnovsky, P Seymour
Journal of Combinatorial Theory, Series B 100 (6), 560-572, 2010
692010
Three-coloring and list three-coloring of graphs without induced paths on seven vertices
F Bonomo, M Chudnovsky, P Maceli, O Schaudt, M Stein, M Zhong
Combinatorica 38 (4), 779-801, 2018
672018
The three-in-a-tree problem
M Chudnovsky, P Seymour
Combinatorica 30 (4), 387-417, 2010
662010
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory
B Birand, M Chudnovsky, B Ries, P Seymour, G Zussman, Y Zwols
IEEE/ACM Transactions on Networking 20 (1), 163-176, 2011
542011
Bisimplicial vertices in even-hole-free graphs
L Addario-Berry, M Chudnovsky, F Havet, B Reed, P Seymour
Journal of Combinatorial Theory, Series B 98 (6), 1119-1164, 2008
542008
The Erdős–Hajnal conjecture for bull-free graphs
M Chudnovsky, S Safra
Journal of Combinatorial Theory, Series B 98 (6), 1301-1310, 2008
532008
Detecting even holes
M Chudnovsky, K Kawarabayashi, P Seymour
Journal of Graph Theory 48 (2), 85-111, 2005
522005
Claw-free graphs. III. Circular interval graphs
M Chudnovsky, P Seymour
Journal of Combinatorial Theory, Series B 98 (4), 812-834, 2008
502008
Berge trigraphs
M Chudnovsky
Journal of Graph Theory 53 (1), 1-55, 2006
502006
Tournaments and colouring
E Berger, K Choromanski, M Chudnovsky, J Fox, M Loebl, A Scott, ...
Journal of Combinatorial Theory, Series B 103 (1), 1-20, 2013
462013
Coloring quasi‐line graphs
M Chudnovsky, A Ovetsky
Journal of Graph Theory 54 (1), 41-50, 2007
452007
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20