22 citations · 92 across the 73 of their papers we have counts for
Showing 2005Show all
2 papers · 1 filter
math.CO2005
Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
Daniel W. Cranston
Let be a planar graph with no two 3-cycles sharing an edge. We show that if , then and We also show that if , then $…
math.CO2005
Pebbling and Optimal Pebbling in Graphs
D. P. Bunde, E. W. Chambers, D. Cranston +2
Given a distribution of pebbles on the vertices of a graph G, a {\it pebbling move} takes two pebbles from one vertex and puts one on a neighboring vertex. The {\it pebbling number…