2 papers
math.CO2023
A characterization of graphs of radius- flip-width at most
Yeonsu Chang, Sejin Ko, O-joung Kwon +1
The -flip-width of a graph, for , is a graph parameter defined in terms of a variant of the cops and robber game, called the flipper game, and it…
math.CO2022
Common graphs with arbitrary connectivity and chromatic number
Sejin Ko, Joonkyung Lee
A graph is common if the number of monochromatic copies of in a 2-edge-colouring of the complete graph is asymptotically minimised by the random colouring. We prove t…