|
Search the dblp DataBase
Maria Chudnovsky:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Maria Chudnovsky, Paul D. Seymour
The structure of claw-free graphs. [Citation Graph (0, 0)][DBLP] Surveys in Combinatorics, 2005, pp:153-171 [Conf]
- Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul D. Seymour, Kristina Vuskovic
Recognizing Berge Graphs. [Citation Graph (0, 0)][DBLP] Combinatorica, 2005, v:25, n:2, pp:143-186 [Journal]
- Maria Chudnovsky, Paul D. Seymour
The roots of the independence polynomial of a clawfree graph. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2007, v:97, n:3, pp:350-357 [Journal]
- Maria Chudnovsky, Ken-ichi Kawarabayashi, Paul D. Seymour
Detecting even holes. [Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2005, v:48, n:2, pp:85-111 [Journal]
- Maria Chudnovsky
Berge trigraphs. [Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2006, v:53, n:1, pp:1-55 [Journal]
- Maria Chudnovsky, Alexandra Ovetsky
Coloring quasi-line graphs. [Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2007, v:54, n:1, pp:41-50 [Journal]
- Maria Chudnovsky, Paul D. Seymour
Testing for a theta. [Citation Graph (0, 0)][DBLP] SODA, 2007, pp:595-598 [Conf]
- Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis A. Goddyn, Michael Lohman, Paul D. Seymour
Packing Non-Zero A-Paths In Group-Labelled Graphs. [Citation Graph (0, 0)][DBLP] Combinatorica, 2006, v:26, n:5, pp:521-532 [Journal]
- Maria Chudnovsky, Paul D. Seymour
Claw-free graphs. I. Orientable prismatic graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2007, v:97, n:6, pp:867-903 [Journal]
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. [Citation Graph (, )][DBLP]
An algorithm for packing non-zero A -paths in group-labelled graphs. [Citation Graph (, )][DBLP]
Cycles in dense digraphs. [Citation Graph (, )][DBLP]
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs. [Citation Graph (, )][DBLP]
Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|