3 papers
math.CO2025
A Size Condition for Small Diameter Orientable Graphs
Sopon Boriboon, Teeradej Kittipassorn
In 2002, Koh and Tay conjectured that every bridgeless graph of order and size at least has an orientation of diameter two. Later, Cochran, Czabarka, D…
math.CO2020
The graph grabbing game on blow-ups of trees and cycles
Sopon Boriboon, Teeradej Kittipassorn
The graph grabbing game is played on a non-negatively weighted connected graph by Alice and Bob who alternately claim a non-cut vertex from the remaining graph, where Alice plays f…
math.CO2020
A strategy for Isolator in the Toucher-Isolator game on trees
Sopon Boriboon, Teeradej Kittipassorn
In the Toucher-Isolator game, introduced recently by Dowden, Kang, Mikalački and Stojaković, Toucher and Isolator alternately claim an edge from a graph such that Toucher aims to t…