58 citations · 549 across the 45 of their papers we have counts for
Showing 2016 · math.COShow all
2 papers · 2 filters
math.CO2016★ 5 cited
Polychromatic colorings of complete graphs with respect to 1-,2-factors and Hamiltonian cycles
Maria Axenovich, John Goldwasser, Ryan Hansen +5
If G is a graph and H is a set of subgraphs of G, then an edge-coloring of G is called H-polychromatic if every graph from H gets all colors present in G on its edges. The H-polych…
math.CO2016★ 4 cited
Injective choosability of subcubic planar graphs with girth 6
Boris Brimkov, Jennifer Edmond, Robert Lazar +3
An injective coloring of a graph is an assignment of colors to the vertices of so that any two vertices with a common neighbor have distinct colors. A graph is injectiv…