Matthew P. Yancey

24 papers B 1C 1Misc 1Journal 21
YearRankTypeTitle / Venue / Authors
2022 J jnl
Bipartite communities via spectral partitioning.
J. Comb. Optim.
Kelly B. Yancey, Matthew P. Yancey
2021 J jnl
Vertex Partitions into an Independent Set and a Forest with Each Component Small.
SIAM J. Discret. Math.
Daniel W. Cranston, Matthew P. Yancey
2020 J jnl
Positively curved graphs.
J. Graph Theory
Matthew P. Yancey
2020 J jnl
Sparse Graphs Are Near-Bipartite.
SIAM J. Discret. Math.
Daniel W. Cranston, Matthew P. Yancey
2019 J jnl
Sparse graphs are near-bipartite.
CoRR
Daniel W. Cranston, Matthew P. Yancey
2018 J jnl
A Brooks-Type Result for Sparse Critical Graphs.
Comb.
Alexandr V. Kostochka, Matthew P. Yancey
2018 C conf
Bipartite Communities via Spectral Partitioning.
COCOA
Kelly B. Yancey, Matthew P. Yancey
2017 B conf
Regular Language Distance and Entropy.
MFCS
Austin J. Parker, Kelly B. Yancey, Matthew P. Yancey
2016 J jnl
Coloring the square of a sparse graph G with almost Δ(G) colors.
Discret. Appl. Math.
Matthew P. Yancey
2016 J jnl
I, F-partitions of sparse graphs.
Eur. J. Comb.
Axel Brandt, Michael Ferrara, Mohit Kumbhat, Sarah Loeb, Derrick Stolee, Matthew P. Yancey
2016 J jnl
Regular Language Distance and Entropy.
CoRR
Austin J. Parker, Kelly B. Yancey, Matthew P. Yancey
2015 J jnl
I, F-partitions of Sparse Graphs.
CoRR
Axel Brandt, Michael Ferrara, Mohit Kumbhat, Sarah Loeb, Derrick Stolee, Matthew P. Yancey
2014 J jnl
Bipartite Communities.
CoRR
Matthew P. Yancey
2014 J jnl
Ore's conjecture for k=4 and Grötzsch's Theorem.
Comb.
Alexandr V. Kostochka, Matthew P. Yancey
2014 J jnl
Ore's conjecture on color-critical graphs is almost true.
J. Comb. Theory B
Alexandr V. Kostochka, Matthew P. Yancey
2014 J jnl
Planar 4-critical graphs with four triangles.
Eur. J. Comb.
Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
2014 J jnl
Short proofs of coloring theorems on planar graphs.
Eur. J. Comb.
Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
2013 J jnl
Describing 3-paths in normal plane maps.
Discret. Math.
Oleg V. Borodin, Anna O. Ivanova, Tommy R. Jensen, Alexandr V. Kostochka, Matthew P. Yancey
2013 J jnl
Extremal Graphs With a Given Number of Perfect Matchings.
J. Graph Theory
Stephen G. Hartke, Derrick Stolee, Douglas B. West, Matthew P. Yancey
2013 J jnl
On 11-improper 22-coloring of sparse graphs.
Discret. Math.
Oleg V. Borodin, Alexandr V. Kostochka, Matthew P. Yancey
2013 Misc conf
On Coloring of Sparse Graphs.
CSR
Alexandr V. Kostochka, Matthew P. Yancey
2013 J jnl
Planar 4-critical graphs with four triangles.
CoRR
Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
2012 J jnl
Large Rainbow Matchings in Edge-Coloured Graphs.
Comb. Probab. Comput.
Alexandr V. Kostochka, Matthew P. Yancey
2012 J jnl
Short proofs of coloring theorems on planar graphs
CoRR
Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey