Matthew P. Yancey

most citedOre's Conjecture for

k = 4

and Gr\" otzsch Theorem

8 citations · 12 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2012★ 8 cited

Ore's Conjecture for $k = 4$ and Gr\" otzsch Theorem

Alexandr Kostochka, Matthew Yancey

A graph $G$ is $k$ -{\em critical} if it has chromatic number $k$ , but every proper subgraph of $G$ is $(k - 1)$ --colorable. Let $f_{k} (n)$ denote the minimum number of edges in an $n$ -…

math.CO2012★ 4 cited

Ore's Conjecture on color-critical graphs is almost true

Alexandr Kostochka, Matthew Yancey

A graph $G$ is $k$ -critical if it has chromatic number $k$ , but every proper subgraph of $G$ is $(k - 1)$ --colorable. Let $f_{k} (n)$ denote the minimum number of edges in an $n$ -vertex…

Ore's Conjecture for k=4 and Gr\" otzsch Theorem

Ore's Conjecture on color-critical graphs is almost true

Ore's Conjecture for $k = 4$ and Gr\" otzsch Theorem