Matthew P. Yancey

According to our database, Matthew P. Yancey authored at least 18 papers between 2012 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2021

Vertex Partitions into an Independent Set and a Forest with Each Component Small.

Daniel W. Cranston, Matthew P. Yancey

SIAM J. Discret. Math., 2021

2020

Sparse Graphs Are Near-Bipartite.

Daniel W. Cranston, Matthew P. Yancey

SIAM J. Discret. Math., 2020

Positively curved graphs.

Matthew P. Yancey

J. Graph Theory, 2020

2018

A Brooks-Type Result for Sparse Critical Graphs.

Alexandr V. Kostochka, Matthew P. Yancey

Comb., 2018

Bipartite Communities via Spectral Partitioning.

Kelly B. Yancey, Matthew P. Yancey

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Regular Language Distance and Entropy.

Austin J. Parker, Kelly B. Yancey, Matthew P. Yancey

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

I, F-partitions of sparse graphs.

Axel Brandt, Michael Ferrara, Mohit Kumbhat, Sarah Loeb, Derrick Stolee, Matthew P. Yancey

Eur. J. Comb., 2016

Coloring the square of a sparse graph G with almost Δ(G) colors.

Matthew P. Yancey

Discret. Appl. Math., 2016

2014

Ore's conjecture on color-critical graphs is almost true.

Alexandr V. Kostochka, Matthew P. Yancey

J. Comb. Theory B, 2014

Short proofs of coloring theorems on planar graphs.

Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey

Eur. J. Comb., 2014

Planar 4-critical graphs with four triangles.

Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey

Eur. J. Comb., 2014

Bipartite Communities.

Matthew P. Yancey

CoRR, 2014

Ore's conjecture for k=4 and Grötzsch's Theorem.

Alexandr V. Kostochka, Matthew P. Yancey

Comb., 2014

2013

Extremal Graphs With a Given Number of Perfect Matchings.

Stephen G. Hartke, Derrick Stolee, Douglas B. West, Matthew P. Yancey

J. Graph Theory, 2013

On 11-improper 22-coloring of sparse graphs.

Oleg V. Borodin, Alexandr V. Kostochka, Matthew P. Yancey

Discret. Math., 2013

Describing 3-paths in normal plane maps.

Oleg V. Borodin, Anna O. Ivanova, Tommy R. Jensen, Alexandr V. Kostochka, Matthew P. Yancey

Discret. Math., 2013

On Coloring of Sparse Graphs.

Alexandr V. Kostochka, Matthew P. Yancey

Proceedings of the Computer Science - Theory and Applications, 2013

2012

Large Rainbow Matchings in Edge-Coloured Graphs.

Alexandr V. Kostochka, Matthew P. Yancey

Comb. Probab. Comput., 2012