6 citations · 9 across the 12 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016★ 1 cited
Every 4-regular 4-uniform hypergraph has a 2-coloring with a free vertex
Michael A Henning, Anders Yeo
In this paper, we continue the study of -colorings in hypergraphs. A hypergraph is -colorable if there is a -coloring of the vertices with no monochromatic hyperedge. It i…
math.CO2016★ 6 cited
Thoroughly Distributed Colorings
Wayne Goddard, Michael A. Henning
We consider (not necessarily proper) colorings of the vertices of a graph where every color is thoroughly distributed, that is, appears in every open neighborhood. Equivalently, ev…