1 citations · 1 across the 3 of their papers we have counts for
6 papers · 1 filter
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…
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…
The thickness of the Kronecker product of graphs
Xia Guo, Yan Yang
The thickness of a graph is the minimum number of planar subgraphs whose union is . In this paper, we present sharp lower and upper bounds for the thickness of the Kronecker…
The Thickness of K_1,n,n and K_2,n,n
Xia Guo, Yan Yang
The thickness of a graph G is the minimum number of planar subgraphs whose union is G. In this paper, we obtain the thickness of complete 3-partite graph K_1,n,n, K_2,n,n and compl…