16 citations · 53 across the 13 of their papers we have counts for
4 papers · 1 filter
Optimal pebbling number of the square grid
Ervin Győri, Gyula Y. Katona, László F. Papp
A pebbling move on a graph removes two pebbles from a vertex and adds one pebble to an adjacent vertex. A vertex is reachable from a pebble distribution if it is possible to move a…
Optimal pebbling number of graphs with given minimum degree
Andrzej Czygrinow, Glenn Hurlbert, Gyula Y. Katona +1
Consider a distribution of pebbles on a connected graph . A pebbling move removes two pebbles from a vertex and places one to an adjacent vertex. A vertex is reachable under a p…
Decomposition of a graph into two disjoint odd subgraphs
Mikio Kano, Gyula Y. Katona, Kitti Varga
An odd (resp. even) subgraph in a multigraph is its subgraph in which every vertex has odd (resp. even) degree. We say that a multigraph can be decomposed into two odd subgraphs if…
Minimal toughness in special graph classes
Gyula Y. Katona, Kitti Varga
Let be a positive real number. A graph is called -tough if the removal of any vertex set that disconnects the graph leaves at most components, and all graphs are…