7 search results - page 2 / 2 » Short Cycle Covers of Graphs with Minimum Degree Three |
69
Voted
JGT
2008
14 years 11 months ago
2008
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number (G) is th...
84
Voted
GC
2007
Springer
14 years 11 months ago
2007
Springer
We localize and strengthen Katona’s idea of an edge-toughness to a local topological toughness. We disprove a conjecture of Katona concerning the connection between edgetoughnes...