13 citations · 20 across the 13 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
Coupon-Coloring and total domination in Hamiltonian planar triangulations
Zoltán Lóránt Nagy
We consider the so-called coupon-coloring of the vertices of a graph where every color appears in every open neighborhood, and our aim is to determine the maximal number of colors…
math.CO2017★ 1 cited
Transversals in generalized Latin squares
János Barát, Zoltán Lóránt Nagy
We are seeking a sufficient condition that forces a transversal in a generalized Latin square. A generalized Latin square of order is equivalent to a proper edge-coloring of $K…
math.CO2017
Saturating sets in projective planes and hypergraph covers
Zoltán Lóránt Nagy
Let be an arbitrary finite projective plane of order . A subset of its points is called saturating if any point outside is collinear with a pair of points from …