1 citations · 1 across the 4 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
math.CO2026
An asymptotically tight bound on oriented diameter
Jiangdong Ai, Yaojun Chen, Yaokun Feng +5
Let be the smallest integer such that every finite connected bridgeless simple graph of diameter admits a strong orientation of diameter at most . Chvátal and Thom…
math.CO2026
Stacking and Clearing in Directed Graph Pebbling
Tamás Csernák, Lajos Soukup
Suppose that pebbles are distributed on the vertices of a directed graph D. A directed pebbling step u -> v along an arc u -> v removes two pebbles from u and places one pebble on…
math.CO2026
Stacking and clearing in graph pebbling
Tamás Csernák, Lajos Soukup
Suppose that pebbles are distributed on the vertices of a graph G. A pebbling step along an edge uv removes two pebbles from u and places one pebble on v. We introduce two new grap…