☰

Matthew P. Yancey, Ph.D. - Publications

Affiliations: 
2013 Mathematics University of Illinois, Urbana-Champaign, Urbana-Champaign, IL 
Area:
Mathematics, Applied Mathematics
Tree Info Similar researchers PubMed Report error

12 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 Cranston DW, Yancey MP. Sparse Graphs Are Near-Bipartite Siam Journal On Discrete Mathematics. 34: 1725-1768. DOI: 10.1137/19M1299712  0.452
2020 Yancey KB, Yancey MP. Bipartite communities via spectral partitioning Journal of Combinatorial Optimization. 1-34. DOI: 10.1007/S10878-020-00574-4  0.303
2020 Yancey MP. Positively curved graphs Journal of Graph Theory. 94: 539-578. DOI: 10.1002/Jgt.22545  0.501
2018 Kostochka AV, Yancey MP. A Brooks-type result for sparse critical graphs Combinatorica. 38: 887-934. DOI: 10.1007/S00493-017-3068-3  0.446
2016 Brandt A, Ferrara M, Kumbhat M, Loeb S, Stolee D, Yancey M. I,F-partitions of sparse graphs European Journal of Combinatorics. 57: 1-12. DOI: 10.1016/J.Ejc.2016.03.003  0.559
2014 Kostochka A, Yancey M. Ore's conjecture on color-critical graphs is almost true Journal of Combinatorial Theory, Series B. 109: 73-101. DOI: 10.1016/J.Jctb.2014.05.002  0.493
2014 Borodin OV, Dvořák Z, Kostochka AV, Lidický B, Yancey M. Planar 4-critical graphs with four triangles European Journal of Combinatorics. 41: 138-151. DOI: 10.1016/J.Ejc.2014.03.009  0.546
2014 Borodin OV, Kostochka AV, Lidický B, Yancey M. Short proofs of coloring theorems on planar graphs European Journal of Combinatorics. 36: 314-321. DOI: 10.1016/J.Ejc.2013.05.002  0.57
2014 Kostochka A, Yancey M. Ore's conjecture for k=4 and Grötzsch's Theorem Combinatorica. 34: 323-329. DOI: 10.1007/S00493-014-3020-X  0.472
2013 Borodin OV, Kostochka AV, Yancey MP. On 1-improper 2-coloring of sparse graphs Discrete Mathematics. 313: 2638-2649. DOI: 10.1016/J.Disc.2013.07.014  0.511
2013 Hartke SG, Stolee D, West DB, Yancey M. Extremal graphs with a given number of perfect matchings Journal of Graph Theory. 73: 449-468. DOI: 10.1002/Jgt.21687  0.421
2012 Kostochka A, Yancey M. Large rainbow matchings in edge-coloured graphs Combinatorics, Probability & Computing. 21: 255-263. DOI: 10.1017/S0963548311000605  0.583
Show low-probability matches.