Matthew P. Yancey

activity

20122026

most citedPlanar 4-critical graphs with four triangles

19 citations · 60 across the 17 of their papers we have counts for

collaborators

Showing 2015Show all

4 papers · 1 filter

math.CO2015

Negatively Curved Graphs

Matthew Yancey

Many applications in network science have recently been discovered for the "curvature" of a network, but there is no consensus on the definition for this term. A common approach in…

math.CO2015

I,F-partitions of Sparse Graphs

Axel Brandt, Michael Ferrara, Mohit Kumbhat +3

A star $k$ -coloring is a proper $k$ -coloring where the union of two color classes induces a star forest. While every planar graph is 4-colorable, not every planar graph is star 4-c…

math.CO2015

Bipartite noisy hypercubes have large higher-order Cheeger separation

Kelly Yancey, Matthew Yancey

The expansion of a graph is typically associated with its spectral properties - testing whether a graph is an expander is usually done using Cheeger's inequality. One can also use…

math.CO2015★ 1 cited

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

Matthew Yancey

For a graph $G$ , let $G^{2}$ be the graph with the same vertex set as $G$ and $x y \in E (G^{2})$ when $x \neq = y$ and $d_{G} (x, y) \leq 2$ . Bonamy, Lévêque, and Pinlou conjectured that if $…

Negatively Curved Graphs

I,F-partitions of Sparse Graphs

Bipartite noisy hypercubes have large higher-order Cheeger separation

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

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