default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaria Chudnovsky
Person information
- affiliation: Princeton University, USA
- affiliation: Columbia University, New York City, USA
- award (2009): Fulkerson Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j154]Tara Abrishami, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets. Discret. Math. 348(1): 114195 (2025)- [j153]Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole. Eur. J. Comb. 124: 104074 (2025) - 2024
- [j152]Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs. Comb. 44(5): 921-948 (2024) - [j151]Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
List-k-Coloring H-Free Graphs for All k>4. Comb. 44(5): 1063-1068 (2024) - [j150]Maria Chudnovsky, Ian M. J. McInnis
:
Characterizing and generalizing cycle completable graphs. Discret. Math. 347(2): 113754 (2024) - [j149]Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Pure pairs. X. Tournaments and the strong Erdős-Hajnal property. Eur. J. Comb. 115: 103786 (2024) - [j148]Tara Abrishami, Eli Berger, Maria Chudnovsky, Shira Zerbib:
Graphs with no even holes and no sector wheels are the union of two chordal graphs. Eur. J. Comb. 122: 104035 (2024) - [j147]Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Bipartite graphs with no K6 minor. J. Comb. Theory B 164: 68-104 (2024) - [j146]Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Sepehr Hajebi, Pawel Rzazewski, Sophie Spirkl, Kristina Vuskovic:
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree. J. Comb. Theory B 164: 371-403 (2024) - [j145]Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs. J. Comb. Theory B 164: 443-472 (2024) - [j144]Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl, Kristina Vuskovic:
Induced subgraphs and tree decompositions V. one neighbor in a hole. J. Graph Theory 105(4): 542-561 (2024) - [j143]Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé:
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs. SIAM J. Comput. 53(1): 47-86 (2024) - [j142]Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring. SIAM J. Comput. 53(1): 111-145 (2024) - [j141]Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring. SIAM J. Comput. 53(1): 146-187 (2024) - [j140]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour:
Induced Subgraphs of Bounded Treewidth and the Container Method. SIAM J. Comput. 53(3): 624-647 (2024) - [j139]Maria Chudnovsky, Sergey Norin, Paul D. Seymour, Jérémie Turcotte:
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs. SIAM J. Discret. Math. 38(1): 845-856 (2024) - [c15]Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Sparse induced subgraphs in P6-free graphs. SODA 2024: 5291-5299 - [c14]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski:
Max Weight Independent Set in Sparse Graphs with No Long Claws. STACS 2024: 4:1-4:15 - [i39]Maria Chudnovsky, Meike Hatzel, Tuukka Korhonen, Nicolas Trotignon, Sebastian Wiederrecht:
Unavoidable induced subgraphs in graphs with complete bipartite induced minors. CoRR abs/2405.01879 (2024) - [i38]Maria Chudnovsky, Peter Gartland, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl:
Tree Independence Number IV. Even-hole-free Graphs. CoRR abs/2407.08927 (2024) - 2023
- [j138]Tara Abrishami, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced Subgraphs and Tree Decompositions IV. (Even Hole, Diamond, Pyramid)-Free Graphs. Electron. J. Comb. 30(2) (2023) - [j137]Maria Chudnovsky, Eran Nevo:
Stable sets in flag spheres. Eur. J. Comb. 110: 103699 (2023) - [j136]Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Polynomial bounds for chromatic number VI. Adding a four-vertex path. Eur. J. Comb. 110: 103710 (2023) - [j135]Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong:
Complexity of Ck-coloring in hereditary classes of graphs. Inf. Comput. 292: 105015 (2023) - [j134]Maria Chudnovsky, Paul D. Seymour:
Even-hole-free graphs still have bisimplicial vertices. J. Comb. Theory B 161: 331-381 (2023) - [j133]Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Strengthening Rödl's theorem. J. Comb. Theory B 163: 256-271 (2023) - [j132]Maria Chudnovsky, Paul D. Seymour:
Proof of a conjecture of Plummer and Zha. J. Graph Theory 103(3): 437-450 (2023) - [j131]Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Polynomial bounds for chromatic number VII. Disjoint holes. J. Graph Theory 104(3): 499-515 (2023) - [j130]Ron Aharoni, Eli Berger, Maria Chudnovsky, He Guo, Shira Zerbib:
Nonuniform Degrees and Rainbow Versions of the Caccetta-Häggkvist Conjecture. SIAM J. Discret. Math. 37(3): 1704-1714 (2023) - [i37]Maria Chudnovsky, Sergey Norin, Paul D. Seymour, Jérémie Turcotte:
Cops and robbers on P5-free graphs. CoRR abs/2301.13175 (2023) - [i36]Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Sparse induced subgraphs in P_6-free graphs. CoRR abs/2307.07330 (2023) - [i35]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski:
Max Weight Independent Set in sparse graphs with no long claws. CoRR abs/2309.16995 (2023) - [i34]Maria Chudnovsky, Linda Cook, James Davies, Sang-il Oum:
Reuniting χ-boundedness with polynomial χ-boundedness. CoRR abs/2310.11167 (2023) - 2022
- [j129]Ron Aharoni, Eli Berger, Maria Chudnovsky, Shira Zerbib:
Rainbow Paths and Large Rainbow Matchings. Electron. J. Comb. 29(1) (2022) - [j128]Maria Chudnovsky, Patrick Hompe, Alex Scott, Paul D. Seymour, Sophie Spirkl:
Concatenating Bipartite Graphs. Electron. J. Comb. 29(2) (2022) - [j127]Maria Chudnovsky, Adam Kabela, Binlong Li, Petr Vrána:
Forbidden Induced Pairs for Perfectness and $\omega$-Colourability of Graphs. Electron. J. Comb. 29(2) (2022) - [j126]Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius:
Avoidable vertices and edges in graphs: Existence, characterization, and applications. Discret. Appl. Math. 309: 285-300 (2022) - [j125]Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Shira Zerbib:
Tournaments and the strong Erdős-Hajnal Property. Eur. J. Comb. 100: 103440 (2022) - [j124]Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
Graphs with polynomially many minimal separators. J. Comb. Theory B 152: 248-280 (2022) - [j123]Tara Abrishami, Maria Chudnovsky, Kristina Vuskovic:
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree. J. Comb. Theory B 157: 144-175 (2022) - [c13]Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski:
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws. SODA 2022: 1448-1470 - [i33]Maria Chudnovsky, Neeldhara Misra, Daniël Paulusma, Oliver Schaudt, Akanksha Agrawal:
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481). Dagstuhl Reports 12(11): 109-123 (2022) - 2021
- [j122]Maria Chudnovsky, Shenwei Huang, Sophie Spirkl, Mingxian Zhong:
List 3-Coloring Graphs with No Induced P6+rP3. Algorithmica 83(1): 216-251 (2021) - [j121]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Detecting a Long Odd Hole. Comb. 41(1): 1-30 (2021) - [j120]Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Pure Pairs. II. Excluding All Subdivisions of A Graph. Comb. 41(3): 379-405 (2021) - [j119]Maria Chudnovsky, Shenwei Huang, T. Karthick, Jenny Kaufmann:
Square-Free Graphs with no Induced Fork. Electron. J. Comb. 28(2): 2 (2021) - [j118]Maria Chudnovsky, Cemil Dibek, Paul D. Seymour:
New examples of minimal non-strongly-perfect graphs. Discret. Math. 344(5): 112334 (2021) - [j117]Maria Chudnovsky, Alex Scott, Paul D. Seymour, Sophie Spirkl:
A note on simplicial cliques. Discret. Math. 344(9): 112470 (2021) - [j116]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings. J. Comb. Theory B 150: 195-243 (2021) - [j115]Maria Chudnovsky, Paul D. Seymour:
Erdős-Hajnal for cap-free graphs. J. Comb. Theory B 151: 417-434 (2021) - [j114]Maria Chudnovsky, Cemil Dibek:
Strongly perfect claw-free graphs - A short proof. J. Graph Theory 97(3): 359-381 (2021) - [j113]Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl:
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. SIAM J. Discret. Math. 35(4): 2357-2386 (2021) - [j112]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Finding a Shortest Odd Hole. ACM Trans. Algorithms 17(2): 13:1-13:21 (2021) - [j111]Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong:
Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. Theor. Comput. Sci. 850: 98-115 (2021) - [c12]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour:
Induced subgraphs of bounded treewidth and the container method. SODA 2021: 1948-1964 - [i32]Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski:
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws. CoRR abs/2107.05434 (2021) - 2020
- [j110]Ron Aharoni, Eli Berger, Maria Chudnovsky, Frédéric Havet, Zilin Jiang:
Cooperative Colorings of Trees and of Bipartite Graphs. Electron. J. Comb. 27(1): 1 (2020) - [j109]Maria Chudnovsky, Linda Cook, Paul D. Seymour:
Excluding the fork and antifork. Discret. Math. 343(5): 111786 (2020) - [j108]Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
List 3-coloring Pt-free graphs with no induced 1-subdivision of K1, s. Discret. Math. 343(11): 112086 (2020) - [j107]Maria Chudnovsky, Alex Scott, Paul D. Seymour, Sophie Spirkl:
Detecting an Odd Hole. J. ACM 67(1): 5:1-5:12 (2020) - [j106]Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring graphs without induced paths on six vertices. J. Comb. Theory, Ser. B 140: 45-83 (2020) - [j105]Maria Chudnovsky, Alex Scott, Paul D. Seymour, Sophie Spirkl:
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes. J. Comb. Theory, Ser. B 140: 84-97 (2020) - [j104]Maria Chudnovsky, Eran Nevo:
Induced equators in flag spheres. J. Comb. Theory A 176: 105283 (2020) - [j103]Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour:
Corrigendum to "Bisimplicial vertices in even-hole-free graphs". J. Comb. Theory B 142: 374-375 (2020) - [j102]Maria Chudnovsky, Jacob Fox, Alex Scott, Paul D. Seymour, Sophie Spirkl:
Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs. J. Graph Theory 95(3): 315-340 (2020) - [j101]Maria Chudnovsky, T. Karthick, Peter Maceli, Frédéric Maffray:
Coloring graphs with no induced five-vertex path or gem. J. Graph Theory 95(4): 527-542 (2020) - [j100]Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs. SIAM J. Discret. Math. 34(1): 431-469 (2020) - [j99]Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé:
On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five. SIAM J. Discret. Math. 34(2): 1472-1483 (2020) - [c11]Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl:
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. ESA 2020: 35:1-35:17 - [c10]Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé:
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs. SODA 2020: 2260-2278 - [i31]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour:
Induced subgraphs of bounded treewidth and the container method. CoRR abs/2003.05185 (2020) - [i30]Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl:
Finding large $H$-colorable subgraphs in hereditary graph classes. CoRR abs/2004.09425 (2020) - [i29]Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong:
Complexity of Ck-coloring in hereditary classes of graphs. CoRR abs/2005.01824 (2020) - [i28]Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
List-three-coloring Pt-free graphs with no induced 1-subdivision of K1, s. CoRR abs/2006.03009 (2020)
2010 – 2019
- 2019
- [j98]Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong:
Approximately Coloring Graphs Without Long Induced Paths. Algorithmica 81(8): 3186-3199 (2019) - [j97]Maria Chudnovsky, Jacob Fox, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Towards Erdős-Hajnal for Graphs with No 5-Hole. Comb. 39(5): 983-991 (2019) - [j96]Eli Berger, Krzysztof Choromanski, Maria Chudnovsky:
On the Erdős-Hajnal conjecture for six-vertex tournaments. Eur. J. Comb. 75: 113-122 (2019) - [j95]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. XI. Orientations. Eur. J. Comb. 76: 53-61 (2019) - [j94]Ron Aharoni, Eli Berger, Maria Chudnovsky, David M. Howard, Paul D. Seymour:
Large rainbow matchings in general graphs. Eur. J. Comb. 79: 222-227 (2019) - [j93]Maria Chudnovsky, Irene Lo, Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic:
Coloring square-free Berge graphs. J. Comb. Theory B 135: 96-128 (2019) - [j92]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Disjoint paths in unions of tournaments. J. Comb. Theory B 135: 238-255 (2019) - [j91]Maria Chudnovsky, Vaidy Sivaraman:
Perfect divisibility and 2-divisibility. J. Graph Theory 90(1): 54-60 (2019) - [j90]Maria Chudnovsky, Chun-Hung Liu, Oliver Schaudt, Sophie Spirkl, Nicolas Trotignon, Kristina Vuskovic:
Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. J. Graph Theory 92(2): 67-95 (2019) - [j89]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. XII. Distant stars. J. Graph Theory 92(3): 237-254 (2019) - [c9]Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong:
Complexity of Ck-Coloring in Hereditary Classes of Graphs. ESA 2019: 31:1-31:15 - [c8]Sophie Spirkl, Maria Chudnovsky, Mingxian Zhong:
Four-coloring P6-free graphs. SODA 2019: 1239-1256 - [c7]Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius:
Avoidable Vertices and Edges in Graphs. WADS 2019: 126-139 - [i27]Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé:
On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five. CoRR abs/1903.04761 (2019) - [i26]Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé:
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs. CoRR abs/1907.04585 (2019) - [i25]Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius:
Avoidable Vertices and Edges in Graphs. CoRR abs/1907.12078 (2019) - [i24]Maria Chudnovsky, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
Maximum independent sets in (pyramid, even hole)-free graphs. CoRR abs/1912.11246 (2019) - [i23]Maria Chudnovsky, Daniël Paulusma, Oliver Schaudt:
Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271). Dagstuhl Reports 9(6): 125-142 (2019) - 2018
- [j88]Maria Chudnovsky, Celina M. H. de Figueiredo, Sophie Spirkl:
The Sandwich Problem for Decompositions and Almost Monotone Properties. Algorithmica 80(12): 3618-3645 (2018) - [j87]Flavia Bonomo, Maria Chudnovsky, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong:
Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. Comb. 38(4): 779-801 (2018) - [j86]Maria Chudnovsky, Sophie Spirkl, Shira Zerbib:
Piercing Axis-Parallel Boxes. Electron. J. Comb. 25(1): 1 (2018) - [j85]Maria Chudnovsky, Paul D. Seymour, Sophie Spirkl, Mingxian Zhong:
Triangle-free graphs with no six-vertex induced path. Discret. Math. 341(8): 2179-2196 (2018) - [j84]Maria Chudnovsky, Sang-il Oum:
Vertex-minors and the Erdős-Hajnal conjecture. Discret. Math. 341(12): 3498-3499 (2018) - [j83]Maria Chudnovsky, Ringi Kim, Chun-Hung Liu, Paul D. Seymour, Stéphan Thomassé:
Domination in tournaments. J. Comb. Theory B 130: 98-113 (2018) - [j82]Maria Chudnovsky, Frédéric Maffray, Paul D. Seymour, Sophie Spirkl:
Even pairs and prism corners in square-free Berge graphs. J. Comb. Theory B 131: 12-39 (2018) - [j81]Maria Chudnovsky, Frédéric Maffray, Paul D. Seymour, Sophie Spirkl:
Corrigendum to "Even pairs and prism corners in square-free Berge graphs" [J. Combin. Theory, Ser. B 131 (2018) 12-39]. J. Comb. Theory B 133: 259-260 (2018) - [j80]Maria Chudnovsky:
A short proof of the wonderful lemma. J. Graph Theory 87(3): 271-274 (2018) - [j79]Maria Chudnovsky, Vaidy Sivaraman:
Odd Holes in Bull-Free Graphs. SIAM J. Discret. Math. 32(2): 951-955 (2018) - [j78]Maria Chudnovsky, Juraj Stacho:
3-Colorable Subclasses of P8-Free Graphs. SIAM J. Discret. Math. 32(2): 1111-1138 (2018) - [i22]Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
Four-coloring Ps6-free graphs. I. Extending an excellent precoloring. CoRR abs/1802.02282 (2018) - [i21]Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong:
Four-coloring P6-free graphs. II. Finding an excellent precoloring. CoRR abs/1802.02283 (2018) - [i20]Maria Chudnovsky, T. Karthick, Peter Maceli, Frédéric Maffray:
Coloring graphs with no induced five-vertex path or gem. CoRR abs/1810.06186 (2018) - 2017
- [j77]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes. Comb. 37(6): 1057-1072 (2017) - [j76]Maria Chudnovsky, Aurélie Lagoutte, Paul D. Seymour, Sophie Spirkl:
Colouring perfect graphs with bounded clique number. J. Comb. Theory B 122: 757-775 (2017) - [j75]Maria Chudnovsky, Louis Esperet, Laetitia Lemoine, Peter Maceli, Frédéric Maffray, Irena Penev:
Graphs with No Induced Five-Vertex Path or Antipath. J. Graph Theory 84(3): 221-232 (2017) - [j74]Maria Chudnovsky, Peter Maceli, Juraj Stacho, Mingxian Zhong:
4-Coloring P6-Free Graphs with No Induced 5-Cycles. J. Graph Theory 84(3): 262-285 (2017) - [j73]Maria Chudnovsky, Irene Lo:
Decomposing and Clique-Coloring (Diamond, Odd-Hole)-Free Graphs. J. Graph Theory 86(1): 5-41 (2017) - [c6]Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong:
Approximately Coloring Graphs Without Long Induced Paths. WG 2017: 193-205 - [i19]Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring and list three-coloring H-free graphs. CoRR abs/1703.05684 (2017) - [i18]Maria Chudnovsky, Vaidy Sivaraman:
Odd holes in bull-free graphs. CoRR abs/1704.04262 (2017) - [i17]Maria Chudnovsky, Aurélie Lagoutte, Paul D. Seymour, Sophie Spirkl:
Colouring perfect graphs with bounded clique number. CoRR abs/1707.03747 (2017) - 2016
- [j72]Maria Chudnovsky, Zdenek Dvorák, Tereza Klimosová, Paul D. Seymour:
Immersion in four-edge-connected graphs. J. Comb. Theory B 116: 208-218 (2016) - [j71]Maria Chudnovsky, Gil Kalai, Eran Nevo, Isabella Novik, Paul D. Seymour:
Bipartite minors. J. Comb. Theory B 116: 219-228 (2016) - [j70]Maria Chudnovsky, Ringi Kim, Sang-il Oum, Paul D. Seymour:
Unavoidable induced subgraphs in large graphs with no homogeneous sets. J. Comb. Theory B 118: 1-12 (2016) - [j69]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures. J. Comb. Theory B 118: 109-128 (2016) - [j68]Maria Chudnovsky, Katherine Edwards, Ringi Kim, Alex Scott, Paul D. Seymour:
Disjoint dijoins. J. Comb. Theory B 120: 18-35 (2016) - [c5]Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring graphs with one forbidden induced subgraph. SODA 2016: 1774-1783 - [i16]Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong:
Approximately coloring graphs without long induced paths. CoRR abs/1606.02967 (2016) - 2015
- [j67]Maria Chudnovsky, Paul D. Seymour:
Excluding paths and antipaths. Comb. 35(4): 389-412 (2015) - [j66]Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols:
A De Bruijn-Erdős Theorem for Chordal Graphs. Electron. J. Comb. 22(1): 1 (2015) - [j65]Pierre Aboulker, Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon:
Wheel-free planar graphs. Eur. J. Comb. 49: 57-67 (2015) - [j64]Eli Berger, Krzysztof Choromanski, Maria Chudnovsky:
Forcing large transitive subtournaments. J. Comb. Theory B 112: 1-17 (2015) - [j63]Ron Aharoni, Eli Berger, Maria Chudnovsky, Juba Ziani:
Cliques in the union of graphs. J. Comb. Theory B 114: 170-186 (2015) - [j62]Maria Chudnovsky, Nicolas Trotignon, Théophile Trunck, Kristina Vuskovic:
Coloring perfect graphs with no balanced skew-partitions. J. Comb. Theory B 115: 26-65 (2015) - [j61]Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour:
Edge-colouring seven-regular planar graphs. J. Comb. Theory B 115: 276-302 (2015) - [j60]Maria Chudnovsky, Katherine Edwards, Paul D. Seymour:
Edge-colouring eight-regular planar graphs. J. Comb. Theory B 115: 303-338 (2015) - [j59]Maria Chudnovsky, Sergey Norin, Bruce A. Reed, Paul D. Seymour:
Excluding a Substar and an Antisubstar. SIAM J. Discret. Math. 29(1): 297-308 (2015) - [i15]Maria Chudnovsky, Peter Maceli, Mingxian Zhong:
Three-coloring graphs with no induced seven-vertex path II : using a triangle. CoRR abs/1503.03573 (2015) - [i14]Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring graphs without induced paths on six vertices. CoRR abs/1504.06979 (2015) - 2014
- [j58]Maria Chudnovsky, Paul D. Seymour:
Extending the Gyárfás-Sumner conjecture. J. Comb. Theory B 105: 11-16 (2014) - [j57]Maria Chudnovsky, Paul D. Seymour:
Rao's degree sequence conjecture. J. Comb. Theory B 105: 44-92 (2014) - [j56]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Excluding pairs of graphs. J. Comb. Theory B 106: 15-29 (2014) - [j55]Krzysztof Choromanski, Maria Chudnovsky, Paul D. Seymour:
Tournaments with near-linear transitive subsets. J. Comb. Theory B 109: 228-249 (2014) - [j54]Maria Chudnovsky:
The Erdös-Hajnal Conjecture - A Survey. J. Graph Theory 75(2): 178-190 (2014) - [j53]Maria Chudnovsky, Matthieu Plumettaz:
The Structure of Claw-Free Perfect Graphs. J. Graph Theory 75(3): 203-230 (2014) - [j52]Maria Chudnovsky, Peter Maceli:
Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and the H6-Conjecture. J. Graph Theory 76(4): 249-261 (2014) - [p1]Maria Chudnovsky:
Cliques and stable sets in undirected graphs. Geometry, Structure and Randomness in Combinatorics 2014: 19-25 - [i13]Maria Chudnovsky, Peter Maceli, Juraj Stacho, Mingxian Zhong:
4-coloring $P_6$-free graphs with no induced 5-cycles. CoRR abs/1407.2487 (2014) - [i12]Maria Chudnovsky, Peter Maceli, Mingxian Zhong:
Three-coloring graphs with no induced seven-vertex path I : the triangle-free case. CoRR abs/1409.5164 (2014) - [i11]Maria Chudnovsky, Louis Esperet, Laetitia Lemoine, Peter Maceli, Frédéric Maffray, Irena Penev:
Graphs with no induced five-vertex path or antipath. CoRR abs/1410.0871 (2014) - 2013
- [j51]Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols:
Lines in hypergraphs. Comb. 33(6): 633-654 (2013) - [j50]Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Jacob Fox, Martin Loebl, Alex Scott, Paul D. Seymour, Stéphan Thomassé:
Tournaments and colouring. J. Comb. Theory B 103(1): 1-20 (2013) - [j49]Maria Chudnovsky, Irena Penev, Alex Scott, Nicolas Trotignon:
Substitution and χ-boundedness. J. Comb. Theory B 103(5): 567-586 (2013) - [j48]Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon:
Detecting an induced net subdivision. J. Comb. Theory B 103(5): 630-641 (2013) - [j47]Maria Chudnovsky, Irena Penev:
The Structure of Bull-Free Perfect Graphs. J. Graph Theory 74(1): 1-31 (2013) - [j46]Felix Brandt, Maria Chudnovsky, Ilhee Kim, Gaku Liu, Sergey Norin, Alex Scott, Paul D. Seymour, Stéphan Thomassé:
A counterexample to a conjecture of Schwartz. Soc. Choice Welf. 40(3): 739-743 (2013) - [j45]Maria Chudnovsky, Andrew D. King, Matthieu Plumettaz, Paul D. Seymour:
A Local Strengthening of Reed's Omega, Delta, Chi Conjecture for Quasi-line Graphs. SIAM J. Discret. Math. 27(1): 95-108 (2013) - [i10]Maria Chudnovsky, Peter Maceli:
Ups and downs of the 4-edge path. CoRR abs/1302.0404 (2013) - [i9]Maria Chudnovsky, Peter Maceli, Irena Penev:
Excluding four-edge paths and their complements. CoRR abs/1302.0405 (2013) - [i8]Maria Chudnovsky, Zdenek Dvorák, Tereza Klimosová, Paul D. Seymour:
Immersion in four-edge-connected graphs. CoRR abs/1308.0827 (2013) - [i7]Maria Chudnovsky, Nicolas Trotignon, Théophile Trunck, Kristina Vuskovic:
Coloring perfect graphs with no balanced skew-partitions. CoRR abs/1308.6444 (2013) - [i6]Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon:
Detecting an induced net subdivision. CoRR abs/1309.1960 (2013) - 2012
- [j44]Maria Chudnovsky, Paul D. Seymour:
Packing seagulls. Comb. 32(3): 251-282 (2012) - [j43]Maria Chudnovsky, Sang-il Oum, Paul D. Seymour:
Finding minimum clique capacity. Comb. 32(3): 283-287 (2012) - [j42]Maria Chudnovsky, Paul D. Seymour:
Perfect matchings in planar cubic graphs. Comb. 32(4): 403-424 (2012) - [j41]Maria Chudnovsky, Alexandra Ovetsky Fradkin, Paul D. Seymour:
Tournament immersion and cutwidth. J. Comb. Theory B 102(1): 93-101 (2012) - [j40]Maria Chudnovsky:
The structure of bull-free graphs I - Three-edge-paths with centers and anticenters. J. Comb. Theory B 102(1): 233-251 (2012) - [j39]Maria Chudnovsky:
The structure of bull-free graphs II and III - A summary. J. Comb. Theory B 102(1): 252-282 (2012) - [j38]Maria Chudnovsky, Paul D. Seymour:
Three-colourable perfect graphs without even pairs. J. Comb. Theory B 102(2): 363-394 (2012) - [j37]Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs. VII. Quasi-line graphs. J. Comb. Theory B 102(6): 1267-1294 (2012) - [j36]Maria Chudnovsky, Yori Zwols:
Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement. J. Graph Theory 70(4): 449-472 (2012) - [j35]Maria Chudnovsky, Irena Penev, Alex Scott, Nicolas Trotignon:
Excluding Induced Subdivisions of the Bull and Related Graphs. J. Graph Theory 71(1): 49-68 (2012) - [j34]Maria Chudnovsky, Paul D. Seymour:
Growing Without Cloning. SIAM J. Discret. Math. 26(2): 860-880 (2012) - [j33]Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols:
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. IEEE/ACM Trans. Netw. 20(1): 163-176 (2012) - [i5]Pierre Aboulker, Pierre Charbit, Maria Chudnovsky, Nicolas Trotignon, Kristina Vuskovic:
LexBFS, structure and algorithms. CoRR abs/1205.2535 (2012) - [i4]Maria Chudnovsky, Katherine Edwards, Paul D. Seymour:
Edge-colouring eight-regular planar graphs. CoRR abs/1209.1176 (2012) - [i3]Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour:
Edge-colouring seven-regular planar graphs. CoRR abs/1210.7349 (2012) - 2011
- [j32]Maria Chudnovsky, Bernard Ries, Yori Zwols:
Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs. Discret. Appl. Math. 159(17): 1971-1995 (2011) - [j31]Maria Chudnovsky, Bernard Ries, Yori Zwols:
Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures. Discret. Appl. Math. 159(17): 1996-2029 (2011) - [j30]Maria Chudnovsky, Bruce A. Reed, Paul D. Seymour:
The edge-density for K2, t minors. J. Comb. Theory B 101(1): 18-46 (2011) - [j29]Maria Chudnovsky, Paul D. Seymour:
A well-quasi-order for tournaments. J. Comb. Theory B 101(1): 47-53 (2011) - [i2]Maria Chudnovsky, Andrew D. King, Matthieu Plumettaz, Paul D. Seymour:
A local strengthening of Reed's ω, Δ, χ conjecture for quasi-line graphs. CoRR abs/1109.2112 (2011) - [i1]Maria Chudnovsky, Andrew D. King:
Optimal antithickenings of claw-free trigraphs. CoRR abs/1110.5111 (2011) - 2010
- [j28]Maria Chudnovsky, Paul D. Seymour:
The three-in-a-tree problem. Comb. 30(4): 387-417 (2010) - [j27]Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas:
K4-free graphs with no odd holes. J. Comb. Theory B 100(3): 313-331 (2010) - [j26]Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs VI. Colouring. J. Comb. Theory B 100(6): 560-572 (2010) - [j25]Maria Chudnovsky, Alexandra Ovetsky Fradkin:
An approximate version of Hadwiger's conjecture for claw-free graphs. J. Graph Theory 63(4): 259-278 (2010) - [c4]Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols:
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. INFOCOM 2010: 2213-2221 - [c3]Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols:
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory. S3@MobiCom 2010: 17-20
2000 – 2009
- 2009
- [j24]Flavia Bonomo, Maria Chudnovsky, Guillermo Durán:
Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs. Discret. Math. 309(11): 3485-3499 (2009) - [j23]Maria Chudnovsky, Paul D. Seymour:
Even pairs in Berge graphs. J. Comb. Theory B 99(2): 370-377 (2009) - 2008
- [j22]Maria Chudnovsky, Paul D. Seymour, Blair D. Sullivan:
Cycles in dense digraphs. Comb. 28(1): 1-18 (2008) - [j21]Maria Chudnovsky, William H. Cunningham, Jim Geelen:
An algorithm for packing non-zero A -paths in group-labelled graphs. Comb. 28(2): 145-161 (2008) - [j20]Flavia Bonomo, Maria Chudnovsky, Guillermo Durán:
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs. Discret. Appl. Math. 156(7): 1058-1082 (2008) - [j19]Maria Chudnovsky, Paul D. Seymour:
Solution of three problems of Cornuéjols. J. Comb. Theory B 98(1): 116-135 (2008) - [j18]Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs. II. Non-orientable prismatic graphs. J. Comb. Theory B 98(2): 249-290 (2008) - [j17]Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs. III. Circular interval graphs. J. Comb. Theory B 98(4): 812-834 (2008) - [j16]Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs. IV. Decomposition theorem. J. Comb. Theory B 98(5): 839-938 (2008) - [j15]Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour:
Bisimplicial vertices in even-hole-free graphs. J. Comb. Theory B 98(6): 1119-1164 (2008) - [j14]Maria Chudnovsky, Shmuel Safra:
The Erdös-Hajnal conjecture for bull-free graphs. J. Comb. Theory B 98(6): 1301-1310 (2008) - [j13]Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs. V. Global structure. J. Comb. Theory B 98(6): 1373-1410 (2008) - [j12]Maria Chudnovsky, Alexandra Ovetsky Fradkin:
Hadwiger's conjecture for quasi-line graphs. J. Graph Theory 59(1): 17-33 (2008) - [j11]Maria Chudnovsky, Rohan Kapadia:
Detecting a Theta or a Prism. SIAM J. Discret. Math. 22(3): 1164-1186 (2008) - 2007
- [j10]Maria Chudnovsky, Paul D. Seymour:
The roots of the independence polynomial of a clawfree graph. J. Comb. Theory B 97(3): 350-357 (2007) - [j9]Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs. I. Orientable prismatic graphs. J. Comb. Theory B 97(6): 867-903 (2007) - [j8]Maria Chudnovsky, Alexandra Ovetsky:
Coloring quasi-line graphs. J. Graph Theory 54(1): 41-50 (2007) - [c2]Maria Chudnovsky, Paul D. Seymour:
Testing for a theta. SODA 2007: 595-598 - 2006
- [j7]Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis A. Goddyn, Michael Lohman, Paul D. Seymour:
Packing Non-Zero A-Paths In Group-Labelled Graphs. Comb. 26(5): 521-532 (2006) - [j6]Maria Chudnovsky:
Berge trigraphs. J. Graph Theory 53(1): 1-55 (2006) - 2005
- [j5]Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul D. Seymour, Kristina Vuskovic:
Recognizing Berge Graphs. Comb. 25(2): 143-186 (2005) - [j4]Flavia Bonomo, Maria Chudnovsky, Guillermo Durán:
Partial characterizations of clique-perfect graphs. Electron. Notes Discret. Math. 19: 95-101 (2005) - [j3]Maria Chudnovsky, Ken-ichi Kawarabayashi, Paul D. Seymour:
Detecting even holes. J. Graph Theory 48(2): 85-111 (2005) - [c1]Maria Chudnovsky, Paul D. Seymour:
The structure of claw-free graphs. BCC 2005: 153-171 - 2003
- [j2]Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas:
Progress on perfect graphs. Math. Program. 97(1-2): 405-422 (2003) - 2002
- [j1]Ron Aharoni, Maria Chudnovsky, Andrei Kotlov:
Triangulated Spheres and Colored Cliques. Discret. Comput. Geom. 28(2): 223-229 (2002)
Coauthor Index
[j149] [j147] [j140] [j139] [j136] [j134] [j133] [j132] [j131] [i37] [j128] [j121] [j120] [j118] [j117] [j116] [j115] [j112] [c12] [j109] [j107] [j105] [j103] [j102] [i31] [j97] [j95] [j94] [j92] [j89] [j85] [j83] [j82] [j81] [j77] [j76] [i17] [j72] [j71] [j70] [j69] [j68] [j67] [j65] [j61] [j60] [j59] [j58] [j57] [j56] [j55] [j50] [j48] [j46] [j45] [i8] [i6] [j44] [j43] [j42] [j41] [j38] [j37] [j34] [j33] [i4] [i3] [j30] [j29] [i2] [j28] [j27] [j26] [c4] [c3] [j23] [j22] [j19] [j18] [j17] [j16] [j15] [j13] [j10] [j9] [c2] [j7] [j5] [j3] [c1] [j2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
