1 citations · 2 across the 9 of their papers we have counts for
4 papers · 1 filter
Tight upper bound on the clique size in the square of 2-degenerate graphs
Seog-Jin Kim, Xiaopan Lian
The {\em square} of a graph , denoted , has the same vertex set as and has an edge between two vertices if the distance between them in is at most . In general,…
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…
The square of every subcubic planar graph of girth at least 6 is 7-choosable
Seog-Jin Kim, Xiaopan Lian
The square of a graph , denoted , has the same vertex set as and has an edge between two vertices if the distance between them in is at most . Thomassen (2018) a…
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…