5 citations · 5 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2003
Graph powers and k-ordered Hamiltonicity
Denis Chebikin
It is known that if G is a connected simple graph, then G^3 is Hamiltonian (in fact, Hamilton-connected). A simple graph is k-ordered Hamiltonian if for any sequence v_1, v_2, ...,…
math.CO2003★ 5 cited
A family of bijections between G-parking functions and spanning trees
Denis Chebikin, Pavlo Pylyavskyy
For a directed graph G on vertices {0,1,...,n}, a G-parking function is an n-tuple (b_1,...,b_n) of non-negative integers such that, for every non-empty subset U of {1,...,n}, ther…