Matthew P. Yancey, Ph.D.
Affiliations: | 2013 | Mathematics | University of Illinois, Urbana-Champaign, Urbana-Champaign, IL |
Area:
Mathematics, Applied MathematicsGoogle:
"Matthew Yancey"Parents
Sign in to add mentor| Jozseph Balogh | grad student | 2013 | UIUC | |
| (Sparse color-critical graphs and rainbow matchings in edge-colored graphs.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Cranston DW, Yancey MP. (2020) Sparse Graphs Are Near-Bipartite Siam Journal On Discrete Mathematics. 34: 1725-1768 |
| Yancey KB, Yancey MP. (2020) Bipartite communities via spectral partitioning Journal of Combinatorial Optimization. 1-34 |
| Yancey MP. (2020) Positively curved graphs Journal of Graph Theory. 94: 539-578 |
| Kostochka AV, Yancey MP. (2018) A Brooks-type result for sparse critical graphs Combinatorica. 38: 887-934 |
| Brandt A, Ferrara M, Kumbhat M, et al. (2016) I,F-partitions of sparse graphs European Journal of Combinatorics. 57: 1-12 |
| Kostochka A, Yancey M. (2014) Ore's conjecture on color-critical graphs is almost true Journal of Combinatorial Theory, Series B. 109: 73-101 |
| Borodin OV, Dvořák Z, Kostochka AV, et al. (2014) Planar 4-critical graphs with four triangles European Journal of Combinatorics. 41: 138-151 |
| Borodin OV, Kostochka AV, Lidický B, et al. (2014) Short proofs of coloring theorems on planar graphs European Journal of Combinatorics. 36: 314-321 |
| Kostochka A, Yancey M. (2014) Ore's conjecture for k=4 and Grötzsch's Theorem Combinatorica. 34: 323-329 |
| Borodin OV, Kostochka AV, Yancey MP. (2013) On 1-improper 2-coloring of sparse graphs Discrete Mathematics. 313: 2638-2649 |