Matthew P. Yancey

Orcid: 0000-0001-6521-3451

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Bipartite communities via spectral partitioning.
J. Comb. Optim., 2022

2021
Vertex Partitions into an Independent Set and a Forest with Each Component Small.
SIAM J. Discret. Math., 2021

2020
Sparse Graphs Are Near-Bipartite.
SIAM J. Discret. Math., 2020

Positively curved graphs.
J. Graph Theory, 2020

2018
A Brooks-Type Result for Sparse Critical Graphs.
Comb., 2018

2017
Regular Language Distance and Entropy.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016
I, F-partitions of sparse graphs.
Eur. J. Comb., 2016

Coloring the square of a sparse graph G with almost Δ(G) colors.
Discret. Appl. Math., 2016

2014
Ore's conjecture on color-critical graphs is almost true.
J. Comb. Theory, Ser. B, 2014

Short proofs of coloring theorems on planar graphs.
Eur. J. Comb., 2014

Planar 4-critical graphs with four triangles.
Eur. J. Comb., 2014

Bipartite Communities.
CoRR, 2014

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

2013
Extremal Graphs With a Given Number of Perfect Matchings.
J. Graph Theory, 2013

On 11-improper 22-coloring of sparse graphs.
Discret. Math., 2013

Describing 3-paths in normal plane maps.
Discret. Math., 2013

On Coloring of Sparse Graphs.
Proceedings of the Computer Science - Theory and Applications, 2013

2012
Large Rainbow Matchings in Edge-Coloured Graphs.
Comb. Probab. Comput., 2012


  Loading...