☰

Maria Chudnovsky - Publications

Affiliations: 
Mathematics Columbia University, New York, NY 
 Mathematics Princeton University, Princeton, NJ 
Tree Info Similar researchers PubMed Report error

110 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Aharoni R, Berger E, Chudnovsky M, Havet F, Jiang Z. Cooperative colorings of trees and of bipartite graphs Electronic Journal of Combinatorics. 27. DOI: 10.37236/8111  0.707
2020 Chudnovsky M, Scott A, Seymour PD, Spirkl S. Detecting an odd hole Journal of the Acm. 67: 1-12. DOI: 10.1145/3375720  0.495
2020 Chudnovsky M, Pilipczuk M, Pilipczuk M, Thomassé S. On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five Siam Journal On Discrete Mathematics. 34: 1472-1483. DOI: 10.1137/19M1249473  0.578
2020 Chudnovsky M, Goedgebeur J, Schaudt O, Zhong M. Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs Siam Journal On Discrete Mathematics. 34: 431-469. DOI: 10.1137/18M1210290  0.64
2020 Addario-Berry L, Chudnovsky M, Havet F, Reed BA, Seymour PD. Corrigendum to “Bisimplicial vertices in even-hole-free graphs” Journal of Combinatorial Theory, Series B. 142: 374-375. DOI: 10.1016/J.Jctb.2020.02.001  0.581
2020 Chudnovsky M, Scott A, Seymour PD, Spirkl S. Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes Journal of Combinatorial Theory, Series B. 140: 84-97. DOI: 10.1016/J.Jctb.2019.05.001  0.726
2020 Chudnovsky M, Goedgebeur J, Schaudt O, Zhong M. Obstructions for three-coloring graphs without induced paths on six vertices Journal of Combinatorial Theory, Series B. 140: 45-83. DOI: 10.1016/J.Jctb.2019.04.006  0.656
2020 Chudnovsky M, Nevo E. Induced equators in flag spheres Journal of Combinatorial Theory, Series A. 176: 105283. DOI: 10.1016/J.Jcta.2020.105283  0.314
2020 Chudnovsky M, Spirkl S, Zhong M. List 3-coloring Pt-free graphs with no induced 1-subdivision of K1,s Discrete Mathematics. 343: 112086. DOI: 10.1016/J.Disc.2020.112086  0.536
2020 Chudnovsky M, Cook L, Seymour PD. Excluding the fork and antifork Discrete Mathematics. 343: 111786. DOI: 10.1016/J.Disc.2019.111786  0.789
2020 Chudnovsky M, Scott A, Seymour P, Spirkl S. Pure pairs. I. Trees and linear anticomplete pairs Advances in Mathematics. 107396. DOI: 10.1016/J.Aim.2020.107396  0.732
2020 Chudnovsky M, Scott A, Seymour P, Spirkl S. Proof of the Kalai-Meshulam conjecture Israel Journal of Mathematics. 238: 639-661. DOI: 10.1007/S11856-020-2034-8  0.742
2020 Chudnovsky M, Huang S, Spirkl S, Zhong M. List 3-Coloring Graphs with No Induced $$P_6+rP_3$$P6+rP3 Algorithmica. 1-36. DOI: 10.1007/S00453-020-00754-Y  0.669
2020 Chudnovsky M, Karthick T, Maceli P, Maffray F. Coloring graphs with no induced five‐vertex path or gem Journal of Graph Theory. DOI: 10.1002/Jgt.22572  0.652
2020 Chudnovsky M, Fox J, Scott A, Seymour P, Spirkl S. Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs Journal of Graph Theory. DOI: 10.1002/Jgt.22556  0.741
2019 Chudnovsky M, Scott A, Seymour PD. Disjoint paths in unions of tournaments Journal of Combinatorial Theory, Series B. 135: 238-255. DOI: 10.1016/J.Jctb.2018.08.007  0.655
2019 Chudnovsky M, Lo I, Maffray F, Trotignon N, Vušković K. Coloring square-free Berge graphs Journal of Combinatorial Theory, Series B. 135: 96-128. DOI: 10.1016/J.Jctb.2018.07.010  0.683
2019 Aharoni R, Berger E, Chudnovsky M, Howard DM, Seymour PD. Large rainbow matchings in general graphs European Journal of Combinatorics. 79: 222-227. DOI: 10.1016/J.Ejc.2019.01.012  0.732
2019 Chudnovsky M, Scott A, Seymour PD. Induced subgraphs of graphs with large chromatic number. XI. Orientations European Journal of Combinatorics. 76: 53-61. DOI: 10.1016/J.Ejc.2018.09.003  0.786
2019 Berger E, Choromanski K, Chudnovsky M. On the Erdős–Hajnal conjecture for six-vertex tournaments European Journal of Combinatorics. 75: 113-122. DOI: 10.1016/J.Ejc.2018.08.007  0.827
2019 Chudnovsky M, Fox J, Scott AD, Seymour PD, Spirkl S. Towards Erdős-Hajnal for graphs with no 5-hole Combinatorica. 39: 983-991. DOI: 10.1007/S00493-019-3957-8  0.727
2019 Chudnovsky M, Schaudt O, Spirkl S, Stein M, Zhong M. Approximately Coloring Graphs Without Long Induced Paths Algorithmica. 81: 3186-3199. DOI: 10.1007/S00453-019-00577-6  0.536
2019 Chudnovsky M, Scott A, Seymour PD. Induced subgraphs of graphs with large chromatic number. XII. Distant stars Journal of Graph Theory. 92: 237-254. DOI: 10.1002/Jgt.22450  0.756
2019 Chudnovsky M, Liu C, Schaudt O, Spirkl S, Trotignon N, Vušković K. Triangle‐free graphs that do not contain an induced subdivision of K4 are 3‐colorable Journal of Graph Theory. 92: 67-95. DOI: 10.1002/Jgt.22441  0.656
2018 Chudnovsky M, Sivaraman V. Odd Holes in Bull-Free Graphs Siam Journal On Discrete Mathematics. 32: 951-955. DOI: 10.1137/17M1131301  0.613
2018 Chudnovsky M, Stacho J. 3-Colorable Subclasses of $P_8$-Free Graphs Siam Journal On Discrete Mathematics. 32: 1111-1138. DOI: 10.1137/16M1104858  0.687
2018 Chudnovsky M, Maffray F, Seymour PD, Spirkl S. Corrigendum to “Even pairs and prism corners in square-free Berge graphs” [J. Combin. Theory, Ser. B 131 (2018) 12–39] Journal of Combinatorial Theory, Series B. 133: 259-260. DOI: 10.1016/J.Jctb.2018.07.004  0.502
2018 Chudnovsky M, Maffray F, Seymour PD, Spirkl S. Even pairs and prism corners in square-free Berge graphs Journal of Combinatorial Theory, Series B. 131: 12-39. DOI: 10.1016/J.Jctb.2018.01.003  0.816
2018 Chudnovsky M, Oum Si. Vertex-minors and the Erdős–Hajnal conjecture Discrete Mathematics. 341: 3498-3499. DOI: 10.1016/J.Disc.2018.09.007  0.601
2018 Chudnovsky M, Seymour PD, Spirkl S, Zhong M. Triangle-free graphs with no six-vertex induced path Discrete Mathematics. 341: 2179-2196. DOI: 10.1016/J.Disc.2018.04.020  0.805
2018 Chudnovsky M, Figueiredo CMHd, Spirkl S. The Sandwich Problem for Decompositions and Almost Monotone Properties Algorithmica. 80: 3618-3645. DOI: 10.1007/S00453-018-0409-6  0.518
2017 Chudnovsky M, Kim R, Liu C, Seymour PD, Thomassé S. Domination in tournaments Journal of Combinatorial Theory, Series B. 130: 98-113. DOI: 10.1016/J.Jctb.2017.10.001  0.613
2017 Chudnovsky M, Lagoutte A, Seymour PD, Spirkl S. Colouring perfect graphs with bounded clique number Journal of Combinatorial Theory, Series B. 122: 757-775. DOI: 10.1016/J.Jctb.2016.09.006  0.778
2017 Chudnovsky M, Scott A, Seymour PD. Induced subgraphs of graphs with large chromatic number. III. Long holes Combinatorica. 37: 1057-1072. DOI: 10.1007/S00493-016-3467-X  0.718
2017 Chudnovsky M, Lo I. Decomposing and Clique‐Coloring (Diamond, Odd‐Hole)‐Free Graphs Journal of Graph Theory. 86: 5-41. DOI: 10.1002/Jgt.22110  0.698
2017 Chudnovsky M, Maceli P, Stacho J, Zhong M. 4-Coloring P6-Free Graphs with No Induced 5-Cycles† Journal of Graph Theory. 84: 262-285. DOI: 10.1002/Jgt.22025  0.592
2017 Chudnovsky M, Esperet L, Lemoine L, Maceli P, Maffray F, Penev I. Graphs with No Induced Five‐Vertex Path or Antipath Journal of Graph Theory. 84: 221-232. DOI: 10.1002/Jgt.22022  0.807
2016 Chudnovsky M, Kim R, Oum SI, Seymour P. Unavoidable induced subgraphs in large graphs with no homogeneous sets Journal of Combinatorial Theory. Series B. 118: 1-12. DOI: 10.1016/J.Jctb.2016.01.008  0.868
2016 Chudnovsky M, Scott A, Seymour P. Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures Journal of Combinatorial Theory. Series B. 118: 109-128. DOI: 10.1016/J.Jctb.2016.01.003  0.743
2016 Chudnovsky M, Kalai G, Nevo E, Novik I, Seymour P. Bipartite minors Journal of Combinatorial Theory. Series B. 116: 219-228. DOI: 10.1016/J.Jctb.2015.08.001  0.804
2016 Chudnovsky M, Dvořák Z, Klimošová T, Seymour P. Immersion in four-edge-connected graphs Journal of Combinatorial Theory. Series B. 116: 208-218. DOI: 10.1016/J.Jctb.2015.07.006  0.803
2016 Chudnovsky M, Goedgebeur J, Schaudt O, Zhong M. Obstructions for three-coloring graphs with one forbidden induced subgraph Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 3: 1774-1783.  0.635
2015 Beaudou L, Bondy A, Chen X, Chiniforooshan E, Chudnovsky M, Chvátal V, Fraiman N, Zwols Y. A de Bruijn-Erdős theorem for chordal graphs Electronic Journal of Combinatorics. 22. DOI: 10.37236/3527  0.842
2015 Chudnovsky M, Norin S, Reed B, Seymour P. Excluding a substar and an antisubstar Siam Journal On Discrete Mathematics. 29: 297-308. DOI: 10.1137/130946113  0.755
2015 Chudnovsky M, Edwards K, Seymour P. Edge-colouring eight-regular planar graphs Journal of Combinatorial Theory. Series B. 115: 303-338. DOI: 10.1016/J.Jctb.2015.05.002  0.668
2015 Chudnovsky M, Trotignon N, Trunck T, Vušković K. Coloring perfect graphs with no balanced skew-partitions Journal of Combinatorial Theory. Series B. 115: 26-65. DOI: 10.1016/J.Jctb.2015.04.007  0.54
2015 Aharoni R, Berger E, Chudnovsky M, Ziani J. Cliques in the union of graphs Journal of Combinatorial Theory. Series B. 114: 170-186. DOI: 10.1016/J.Jctb.2015.04.004  0.677
2015 Chudnovsky M, Edwards K, Kawarabayashi Ki, Seymour P. Edge-colouring seven-regular planar graphs Journal of Combinatorial Theory. Series B. 115: 276-302. DOI: 10.1016/J.Jctb.2014.11.005  0.594
2015 Berger E, Choromanski K, Chudnovsky M. Forcing large transitive subtournaments Journal of Combinatorial Theory. Series B. 112: 1-17. DOI: 10.1016/J.Jctb.2014.11.003  0.877
2015 Aboulker P, Chudnovsky M, Seymour P, Trotignon N. Wheel-free planar graphs European Journal of Combinatorics. 49: 57-67. DOI: 10.1016/J.Ejc.2015.02.027  0.8
2015 Chudnovsky M, Scott A, Seymour P. Disjoint paths in tournaments Advances in Mathematics. 270: 582-597. DOI: 10.1016/J.Aim.2014.11.011  0.622
2014 Choromanski K, Chudnovsky M, Seymour P. Tournaments with near-linear transitive subsets Journal of Combinatorial Theory. Series B. 109: 228-249. DOI: 10.1016/J.Jctb.2014.06.007  0.812
2014 Chudnovsky M, Scott A, Seymour P. Excluding pairs of graphs Journal of Combinatorial Theory. Series B. 106: 15-29. DOI: 10.1016/J.Jctb.2014.01.001  0.775
2014 Chudnovsky M, Seymour P. Rao's degree sequence conjecture Journal of Combinatorial Theory. Series B. 105: 44-92. DOI: 10.1016/J.Jctb.2013.12.003  0.777
2014 Chudnovsky M, Seymour P. Extending the Gyárfás-Sumner conjecture Journal of Combinatorial Theory. Series B. 105: 11-16. DOI: 10.1016/J.Jctb.2013.11.002  0.769
2014 Chudnovsky M, Seymour P. Excluding paths and antipaths Combinatorica. 35: 389-412. DOI: 10.1007/S00493-014-3000-Z  0.769
2014 Chudnovsky M, MacEli P. Simplicial vertices in graphs with no induced four-edge path or four-edge antipath, and the H6-conjecture Journal of Graph Theory. 76: 249-261. DOI: 10.1002/Jgt.21763  0.735
2014 Chudnovsky M, Plumettaz M. The structure of claw-free perfect graphs Journal of Graph Theory. 75: 203-230. DOI: 10.1002/Jgt.21732  0.876
2014 Chudnovsky M. The Erdös-Hajnal conjecture - A survey Journal of Graph Theory. 75: 178-190. DOI: 10.1002/Jgt.21730  0.633
2013 Chudnovsky M, King AD, Plumettaz M, Seymour P. A local strengthening of reed's ω, δ, χ conjecture for quasi-line graphs Siam Journal On Discrete Mathematics. 27: 95-108. DOI: 10.1137/110847585  0.857
2013 Chudnovsky M, Edwards K, Kim R, Scott A, Seymour P. Disjoint dijoins Journal of Combinatorial Theory. Series B. DOI: 10.1016/j.jctb.2016.04.002  0.543
2013 Chudnovsky M, Seymour P, Trotignon N. Detecting an induced net subdivision Journal of Combinatorial Theory. Series B. 103: 630-641. DOI: 10.1016/J.Jctb.2013.07.005  0.725
2013 Chudnovsky M, Penev I, Scott A, Trotignon N. Substitution and χ-boundedness Journal of Combinatorial Theory. Series B. 103: 567-586. DOI: 10.1016/J.Jctb.2013.02.004  0.735
2013 Berger E, Choromanski K, Chudnovsky M, Fox J, Loebl M, Scott A, Seymour P, Thomassé S. Tournaments and colouring Journal of Combinatorial Theory. Series B. 103: 1-20. DOI: 10.1016/J.Jctb.2012.08.003  0.837
2013 Beaudou L, Bondy A, Chen X, Chiniforooshan E, Chudnovsky M, Chvátal V, Fraiman N, Zwols Y. Lines in hypergraphs Combinatorica. 33: 633-654. DOI: 10.1007/S00493-013-2910-5  0.802
2013 Brandt F, Chudnovsky M, Kim I, Liu G, Norin S, Scott A, Seymour P, Thomassé S. A counterexample to a conjecture of Schwartz Social Choice and Welfare. 40: 739-743. DOI: 10.1007/S00355-011-0638-Y  0.659
2013 Chudnovsky M, Penev I. The structure of bull-free perfect graphs Journal of Graph Theory. 74: 1-31. DOI: 10.1002/Jgt.21688  0.833
2012 Chudnovsky M, Seymour P. Growing without cloning Siam Journal On Discrete Mathematics. 26: 860-880. DOI: 10.1137/100817255  0.766
2012 Birand B, Chudnovsky M, Ries B, Seymour P, Zussman G, Zwols Y. Analyzing the performance of greedy maximal scheduling via local pooling and graph theory Ieee/Acm Transactions On Networking. 20: 163-176. DOI: 10.1109/Tnet.2011.2157831  0.838
2012 Chudnovsky M, Seymour P. Claw-free graphs. VII. Quasi-line graphs Journal of Combinatorial Theory. Series B. 102: 1267-1294. DOI: 10.1016/J.Jctb.2012.07.005  0.797
2012 Chudnovsky M, Seymour P. Three-colourable perfect graphs without even pairs Journal of Combinatorial Theory. Series B. 102: 363-394. DOI: 10.1016/J.Jctb.2011.11.005  0.805
2012 Chudnovsky M. The structure of bull-free graphs I-Three-edge-paths with centers and anticenters Journal of Combinatorial Theory. Series B. 102: 233-251. DOI: 10.1016/J.Jctb.2011.07.003  0.672
2012 Chudnovsky M. The structure of bull-free graphs II and III-A summary Journal of Combinatorial Theory. Series B. 102: 252-282. DOI: 10.1016/J.Jctb.2011.07.002  0.667
2012 Chudnovsky M, Fradkin A, Seymour P. Tournament immersion and cutwidth Journal of Combinatorial Theory. Series B. 102: 93-101. DOI: 10.1016/J.Jctb.2011.05.001  0.821
2012 Chudnovsky M, Oum SI, Seymour P. Finding minimum clique capacity Combinatorica. 32: 283-287. DOI: 10.1007/S00493-012-2891-9  0.753
2012 Chudnovsky M, Seymour P. Perfect matchings in planar cubic graphs Combinatorica. 32: 403-424. DOI: 10.1007/S00493-012-2660-9  0.78
2012 Chudnovsky M, Seymour P. Packing seagulls Combinatorica. 32: 251-282. DOI: 10.1007/s00493-012-2594-2  0.595
2012 Chudnovsky M, Penev I, Scott A, Trotignon N. Excluding induced subdivisions of the bull and related graphs Journal of Graph Theory. 71: 49-68. DOI: 10.1002/Jgt.20631  0.832
2012 Chudnovsky M, Zwols Y. Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement Journal of Graph Theory. 70: 449-472. DOI: 10.1002/Jgt.20626  0.876
2011 Chudnovsky M, Seymou P. A well-quasi-order for tournaments Journal of Combinatorial Theory. Series B. 101: 47-53. DOI: 10.1016/J.Jctb.2010.10.003  0.68
2011 Chudnovsky M, Reed B, Seymour P. The edge-density for K2,t minors Journal of Combinatorial Theory. Series B. 101: 18-46. DOI: 10.1016/J.Jctb.2010.09.001  0.728
2011 Chudnovsky M, Ries B, Zwols Y. Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures Discrete Applied Mathematics. 159: 1996-2029. DOI: 10.1016/J.Dam.2011.06.031  0.89
2011 Chudnovsky M, Ries B, Zwols Y. Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs Discrete Applied Mathematics. 159: 1971-1995. DOI: 10.1016/J.Dam.2011.06.024  0.89
2010 Chudnovsky M, Seymour P. Claw-free graphs VI. Colouring Journal of Combinatorial Theory. Series B. 100: 560-572. DOI: 10.1016/J.Jctb.2010.04.005  0.787
2010 Chudnovsky M, Robertson N, Seymour P, Thomas R. K4-free graphs with no odd holes Journal of Combinatorial Theory. Series B. 100: 313-331. DOI: 10.1016/J.Jctb.2009.10.001  0.78
2010 Chudnovsky M, Seymour P. THE THREE-IN-A-TREE PROBLEM Combinatorica. 30: 387-417. DOI: 10.1007/S00493-010-2334-4  0.767
2010 Chudnovsky M, Fradkin AO. An approximate version of Hadwiger's conjecture for graphs claw-free Journal of Graph Theory. 63: 259-278. DOI: 10.1002/jgt.20425  0.882
2009 Chudnovsky M, Seymour P. Even pairs in Berge graphs Journal of Combinatorial Theory. Series B. 99: 370-377. DOI: 10.1016/J.Jctb.2008.08.002  0.764
2009 Bonomo F, Chudnovsky M, Durán G. Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs Discrete Mathematics. 309: 3485-3499. DOI: 10.1016/J.Disc.2007.12.054  0.726
2008 Chudnovsky M, Kapadia R. Detecting a theta or a prism Siam Journal On Discrete Mathematics. 22: 1164-1186. DOI: 10.1137/060672613  0.674
2008 Chudnovsky M, Seymour P. Claw-free graphs. V. Global structure Journal of Combinatorial Theory. Series B. 98: 1373-1410. DOI: 10.1016/J.Jctb.2008.03.002  0.788
2008 Chudnovsky M, Seymour P. Claw-free graphs. III. Circular interval graphs Journal of Combinatorial Theory. Series B. 98: 812-834. DOI: 10.1016/J.Jctb.2008.03.001  0.818
2008 Chudnovsky M, Safra S. The Erdo{combining double acute accent}s-Hajnal conjecture for bull-free graphs Journal of Combinatorial Theory. Series B. 98: 1301-1310. DOI: 10.1016/J.Jctb.2008.02.005  0.66
2008 Addario-Berry L, Chudnovsky M, Havet F, Reed B, Seymour P. Bisimplicial vertices in even-hole-free graphs Journal of Combinatorial Theory. Series B. 98: 1119-1164. DOI: 10.1016/J.Jctb.2007.12.006  0.799
2008 Chudnovsky M, Seymour P. Claw-free graphs. IV. Decomposition theorem Journal of Combinatorial Theory. Series B. 98: 839-938. DOI: 10.1016/J.Jctb.2007.06.007  0.79
2008 Chudnovsky M, Seymour P. Claw-free graphs. II. Non-orientable prismatic graphs Journal of Combinatorial Theory. Series B. 98: 249-290. DOI: 10.1016/J.Jctb.2007.06.006  0.797
2008 Chudnovsky M, Seymour P. Solution of three problems of Cornuéjols Journal of Combinatorial Theory. Series B. 98: 116-135. DOI: 10.1016/J.Jctb.2007.05.004  0.702
2008 Bonomo F, Chudnovsky M, Durán G. Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs Discrete Applied Mathematics. 156: 1058-1082. DOI: 10.1016/J.Dam.2007.05.048  0.72
2008 Chudnovsky M, Seymour P, Sullivan B. Cycles in dense digraphs Combinatorica. 28: 1-18. DOI: 10.1007/S00493-008-2331-Z  0.768
2008 Chudnovsky M, Cunningham WH, Geelen J. An algorithm for packing non-zero a-paths in group-labelled graphs Combinatorica. 28: 145-161. DOI: 10.1007/S00493-008-2157-8  0.569
2008 Chudnovsky M, Fradkin AO. Hadwiger's conjecture for quasi-line graphs Journal of Graph Theory. 59: 17-33. DOI: 10.1002/Jgt.V59:1  0.879
2007 Chudnovsky M, Seymour P. Claw-free graphs. I. Orientable prismatic graphs Journal of Combinatorial Theory. Series B. 97: 867-903. DOI: 10.1016/J.Jctb.2007.02.002  0.793
2007 Chudnovsky M, Seymour P. The roots of the independence polynomial of a clawfree graph Journal of Combinatorial Theory. Series B. 97: 350-357. DOI: 10.1016/J.Jctb.2006.06.001  0.778
2007 Chudnovsky M, Ovetsky A. Coloring quasi-line graphs Journal of Graph Theory. 54: 41-50. DOI: 10.1002/Jgt.V54:1  0.69
2006 Chudnovsky M, Robertson N, Seymour P, Thomas R. The strong perfect graph theorem Annals of Mathematics. 164: 51-229. DOI: 10.4007/Annals.2006.164.51  0.82
2006 Chudnovsky M, Geelen J, Gerards B, Goddyn L, Lohman M, Seymour P. Packing non-zero A-paths in group-labelled graphs Combinatorica. 26: 521-532. DOI: 10.1007/S00493-006-0030-1  0.72
2005 Bonomo F, Chudnovsky M, Durán G. Partial characterizations of clique-perfect graphs Electronic Notes in Discrete Mathematics. 19: 95-101. DOI: 10.1016/J.Endm.2005.05.014  0.704
2005 Chudnovsky M, Cornuéjols G, Liu X, Seymour P, Vušković K. Recognizing Berge Graphs Combinatorica. 25: 143-186. DOI: 10.1007/S00493-005-0012-8  0.798
2005 Chudnovsky M, Kawarabayashi KI, Seymour P. Detecting even holes Journal of Graph Theory. 48: 85-111. DOI: 10.1002/Jgt.V48:2  0.654
2003 Chudnovsky M, Robertson N, Seymour PD, Thomas R. Progress on perfect graphs Mathematical Programming. 97: 405-422. DOI: 10.1007/S10107-003-0449-8  0.783
Show low-probability matches.