Maria Chudnovsky

4.7k total citations · 1 hit paper
135 papers, 1.9k citations indexed

About

Maria Chudnovsky is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Maria Chudnovsky has authored 135 papers receiving a total of 1.9k indexed citations (citations by other indexed papers that have themselves been cited), including 129 papers in Computational Theory and Mathematics, 80 papers in Discrete Mathematics and Combinatorics and 28 papers in Electrical and Electronic Engineering. Recurrent topics in Maria Chudnovsky's work include Advanced Graph Theory Research (126 papers), Limits and Structures in Graph Theory (77 papers) and Graph Labeling and Dimension Problems (58 papers). Maria Chudnovsky is often cited by papers focused on Advanced Graph Theory Research (126 papers), Limits and Structures in Graph Theory (77 papers) and Graph Labeling and Dimension Problems (58 papers). Maria Chudnovsky collaborates with scholars based in United States, Canada and United Kingdom. Maria Chudnovsky's co-authors include Paul Seymour, Robin Thomas, Neil Robertson, Kristina Vušković, Xinming Liu, Gérard Cornuéjols, Flavia Bonomo, Alex Scott, Muli Safra and Guillermo Durán and has published in prestigious journals such as Annals of Mathematics, IEEE/ACM Transactions on Networking and Mathematical Programming.

In The Last Decade

Maria Chudnovsky

119 papers receiving 1.8k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

The strong perfect graph theorem

2006 567 citations Maria Chudnovsky, Paul Seymour et al. profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Maria Chudnovsky United States	21	1.7k	937	494	277	225	135	1.9k
Xuding Zhu Taiwan	29	3.1k 1.8×	1.6k 1.7×	574 1.2×	567 2.0×	251 1.1×	261	3.3k
András Gyárfás Hungary	23	1.6k 0.9×	1.3k 1.4×	652 1.3×	315 1.1×	183 0.8×	119	1.8k
Boštjan Brešar Slovenia	20	1.3k 0.8×	434 0.5×	370 0.7×	145 0.5×	308 1.4×	123	1.5k
Michael D. Plummer United States	20	1.3k 0.7×	520 0.6×	447 0.9×	229 0.8×	358 1.6×	92	1.5k
V. Rödl United States	25	1.5k 0.9×	1.4k 1.5×	737 1.5×	322 1.2×	112 0.5×	89	1.9k
James Oxley United States	19	1.2k 0.7×	547 0.6×	257 0.5×	657 2.4×	279 1.2×	142	1.6k
Robert E. Jamison United States	16	718 0.4×	271 0.3×	343 0.7×	155 0.6×	111 0.5×	64	995
W. T. Trotter United States	15	760 0.4×	524 0.6×	225 0.5×	118 0.4×	117 0.5×	41	1.0k
Xueliang Li China	22	1.9k 1.1×	754 0.8×	686 1.4×	279 1.0×	691 3.1×	188	2.1k
Richard J. Nowakowski Canada	19	1.0k 0.6×	344 0.4×	371 0.8×	114 0.4×	244 1.1×	111	1.5k

Countries citing papers authored by Maria Chudnovsky

Since Specialization

Citations

This map shows the geographic impact of Maria Chudnovsky's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Maria Chudnovsky with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Maria Chudnovsky more than expected).

Fields of papers citing papers by Maria Chudnovsky

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Maria Chudnovsky. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Maria Chudnovsky. The network helps show where Maria Chudnovsky may publish in the future.

Co-authorship network of co-authors of Maria Chudnovsky

This figure shows the co-authorship network connecting the top 25 collaborators of Maria Chudnovsky. A scholar is included among the top collaborators of Maria Chudnovsky based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Maria Chudnovsky. Maria Chudnovsky is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Chudnovsky, Maria, et al.. (2023). Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs. Journal of Combinatorial Theory Series B. 164. 443–472. 3 indexed citations

2.

Chudnovsky, Maria, et al.. (2023). Complexity of C-coloring in hereditary classes of graphs. Information and Computation. 292. 105015–105015. 1 indexed citations

3.

Chudnovsky, Maria, Alex Scott, Paul Seymour, & Sophie Spirkl. (2023). Pure pairs. X. Tournaments and the strong Erdős-Hajnal property. European Journal of Combinatorics. 115. 103786–103786.

4.

Chudnovsky, Maria, et al.. (2023). Induced Subgraphs and Tree Decompositions IV. (Even Hole, Diamond, Pyramid)-Free Graphs. The Electronic Journal of Combinatorics. 30(2). 6 indexed citations

5.

Chudnovsky, Maria, et al.. (2020). Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs. SIAM Journal on Discrete Mathematics. 34(1). 431–469. 4 indexed citations

6.

Berger, Eli, Krzysztof Choromański, & Maria Chudnovsky. (2018). On the Erdős–Hajnal conjecture for six-vertex tournaments. European Journal of Combinatorics. 75. 113–122. 7 indexed citations

7.

Chudnovsky, Maria, et al.. (2016). Decomposing and Clique‐Coloring (Diamond, Odd‐Hole)‐Free Graphs. Journal of Graph Theory. 86(1). 5–41. 7 indexed citations

8.

Chudnovsky, Maria, et al.. (2015). Edge-colouring seven-regular planar graphs. Journal of Combinatorial Theory Series B. 115. 276–302. 4 indexed citations

9.

Chudnovsky, Maria, Alex Scott, & Paul Seymour. (2014). Disjoint paths in tournaments. Advances in Mathematics. 270. 582–597. 6 indexed citations

10.

Chudnovsky, Maria. (2013). The Erdös–Hajnal Conjecture—A Survey. Journal of Graph Theory. 75(2). 178–190. 45 indexed citations

11.

Charbit, Pierre, et al.. (2012). LexBFS, structure and algorithms. arXiv (Cornell University). 1 indexed citations

12.

Chudnovsky, Maria & Paul Seymour. (2012). Claw-free graphs. VII. Quasi-line graphs. Journal of Combinatorial Theory Series B. 102(6). 1267–1294. 17 indexed citations

13.

Chudnovsky, Maria & Paul Seymour. (2012). Three-colourable perfect graphs without even pairs. Journal of Combinatorial Theory Series B. 102(2). 363–394.

14.

Chudnovsky, Maria. (2011). The structure of bull-free graphs I—Three-edge-paths with centers and anticenters. Journal of Combinatorial Theory Series B. 102(1). 233–251. 14 indexed citations

15.

Chudnovsky, Maria. (2010). Hadwiger's conjecture and seagull packing. Notices of the American Mathematical Society. 57(6). 733–736. 2 indexed citations

16.

Chudnovsky, Maria, et al.. (2009). An approximate version of Hadwiger's conjecture for claw‐free graphs. Journal of Graph Theory. 63(4). 259–278. 4 indexed citations

17.

Chudnovsky, Maria & Paul Seymour. (2008). Even pairs in Berge graphs. Journal of Combinatorial Theory Series B. 99(2). 370–377. 11 indexed citations

18.

Bonomo, Flavia, Maria Chudnovsky, & Guillermo Durán. (2008). Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs. Discrete Mathematics. 309(11). 3485–3499. 18 indexed citations

19.

Chudnovsky, Maria & Paul Seymour. (2007). Testing for a theta. Symposium on Discrete Algorithms. 595–598. 2 indexed citations

20.

Chudnovsky, Maria & Paul Seymour. (2006). The roots of the independence polynomial of a clawfree graph. Journal of Combinatorial Theory Series B. 97(3). 350–357. 106 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact