1 citations · 1 across the 6 of their papers we have counts for
9 papers · 1 filter
Symmetric property and edge-disjoint Hamiltonian cycles of the spined cube
Da-Wei Yang, Zihao Xu, Yan-Quan Feng +1
The spined cube is a variant of the hypercube , introduced by Zhou et al. in [Information Processing Letters 111 (2011) 561-567] as an interconnection network for paral…
Queue layouts and nonrepetitive colouring of planar graphs and powers of trees
Jiaqi Wang, Daqing Yang
Dujmović, Joret, Micek, Morin, Ueckerdt and Wood recently in [Planar graphs have bounded queue-number, Journal of the ACM, Volume 67, Issue 4, Article No.: 22, August 2020] showed…
Packing of maximal independent mixed arborescences
Hui Gao, Daqing Yang
Király in [On maximal independent arborescence packing, SIAM J. Discrete. Math. 30 (4) (2016), 2107-2114] solved the following packing problem: Given a digraph , a matr…
Existence of non-Cayley Haar graphs
Yan-Quan Feng, István Kovács, Jie Wang +1
A Cayley graph of a group is a finite simple graph such that its automorphism group contains a subgroup isomorphic to acting regularly on , while a…
On coloring numbers of graph powers
H. A. Kierstead, Daqing Yang, Junjun Yi
The weak -coloring numbers of a graph were introduced by the first two authors as a generalization of the usual coloring number , and have since found in…
On basic graphs of symmetric graphs of valency five
Da-Wei Yang, Yan-Quan Feng, Jin Ho Kwak +1
A graph $\G$ is {\em symmetric} or {\em arc-transitive} if its automorphism group $\Aut(\G)$ is transitive on the arc set of the graph, and $\G$ is {\em basic} if $\Aut(\G)$ has no…