16 citations · 53 across the 13 of their papers we have counts for
Showing 2014 · math.COShow all
2 papers · 2 filters
math.CO2014★ 12 cited
The Optimal Rubbling Number of Ladders, Prisms and Möbius-ladders
Gyula Y. Katona, László F. Papp
A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this…
math.CO2014★ 7 cited
Bounds on the Number of Edges in Hypertrees
Gyula Y. Katona, Péter G. N. Szabó
Let be a -uniform hypergraph. A chain in is a sequence of its vertices such that every consecutive vertices form an edge. In 1999 Katona and Kier…