20 citations · 180 across the 43 of their papers we have counts for
4 papers · 1 filter
On a variant of dichromatic number for digraphs with prescribed sets of arcs
O-joung Kwon, Xiaopan Lian
In this paper, we consider a variant of dichromatic number on digraphs with prescribed sets of arcs. Let be a digraph and let be two sets of arcs in . For a subdi…
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…
Group vertex-arboricity of group-labelled graphs
O-joung Kwon, Xiaopan Lian
We introduce the vertex-arboricity of group-labelled graphs. For an abelian group , a -labelled graph is a graph whose edges are labelled by elements of . For an abelian g…
A new width parameter of graphs based on edge cuts: -edge-crossing width
Yeonsu Chang, O-joung Kwon, Myounghwan Lee
We introduce graph width parameters, called -edge-crossing width and edge-crossing width. These are defined in terms of the number of edges crossing a bag of a tree-cut decompos…