Kevin G. Milans

The Complexity of Graph Pebbling

In a graph

Tree-width and dimension

G

First-Fit is Linear on Posets Excluding Two Long Incomparable Chains

whose vertices contain pebbles, a pebbling move

Binary subtrees with few labeled paths

uv

Optimal strong parity edge-coloring of complete graphs

removes two pebbles from

Cycle spectra of Hamiltonian graphs

u

Boolean algebras and Lubell functions

and adds one pebble to a neighbor

Coloring Clean and K4-Free Circle Graphs

v

Overlap Number of Graphs

of

Saturation numbers for families of graph subdivisions

u