3 citations · 5 across the 10 of their papers we have counts for
11 papers
Bounds for DP color function and canonical labelings
Ziqing Li, Yan Yang
The DP-coloring is a generalization of the list coloring, introduced by Dvořák and Postle. Let be a cover of a graph and be the numb…
Some new results on bar visibility of digraphs
Yuanrui Feng, Jun Ge, Douglas B. West +1
Visibility representation of digraphs was introduced by Axenovich, Beveridge, Hutch\-inson, and West (\emph{SIAM J. Discrete Math.} {\bf 27}(3) (2013) 1429--1449) as a natural gene…
DP color functions versus chromatic polynomials
Fengming Dong, Yan Yang
For any graph , the chromatic polynomial of is the function which counts the number of proper -colorings of for each positive integer . The DP color funct…
Upper bounds on the signed edge domination number of a graph
Fengming Dong, Jun Ge, Yan Yang
A signed edge domination function (or SEDF) of a simple graph is a function such that holds for each edge $e\in E…
On the bar visibility number of complete bipartite graphs
Weiting Cao, Douglas B. West, Yan Yang
A -bar visibility representation of a graph assigns each vertex up to horizontal bars in the plane so that two vertices are adjacent if and only if some bar for one vertex c…
Upper bounds for bar visibility of subgraphs and n-vertex graphs
Yuanrui Feng, Douglas B. West, Yan Yang
A -bar visibility representation of a graph assigns each vertex up to horizontal bars in the plane so that two vertices are adjacent if and only if some bar for one vertex c…