19 citations · 60 across the 17 of their papers we have counts for
4 papers · 1 filter
Short proofs of coloring theorems on planar graphs
Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický +1
A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey yields a half-page proof of the celebrated Grötzsch Theorem that every planar tri…
Ore's Conjecture for and Gr\" otzsch Theorem
Alexandr Kostochka, Matthew Yancey
A graph is -{\em critical} if it has chromatic number , but every proper subgraph of is --colorable. Let denote the minimum number of edges in an -…
Ore's Conjecture on color-critical graphs is almost true
Alexandr Kostochka, Matthew Yancey
A graph is -critical if it has chromatic number , but every proper subgraph of is --colorable. Let denote the minimum number of edges in an -vertex…
Large rainbow matchings in large graphs
Alexandr Kostochka, Florian Pfender, Matthew Yancey
A \textit{rainbow subgraph} of an edge-colored graph is a subgraph whose edges have distinct colors. The \textit{color degree} of a vertex is the number of different colors on…