7 citations · 7 across the 2 of their papers we have counts for
2 papers
math.CO2012★ 7 cited
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…
math.CO2012
Harmonious Coloring of Trees with Large Maximum Degree
Saieed Akbari, Jaehoon Kim, Alexandr Kostochka
A harmonious coloring of is a proper vertex coloring of such that every pair of colors appears on at most one pair of adjacent vertices. The harmonious chromatic number of…