X. Zha

activity

20152019

most citedDominating maximal outerplane graphs and Hamiltonian plane triangulations

1 citations · 1 across the 1 of their papers we have counts for

collaborators

6 papers

math.CO2019★ 1 cited

Dominating maximal outerplane graphs and Hamiltonian plane triangulations

Michael D. Plummer, Dong Ye, Xiaoya Zha

Let $G$ be a graph and $γ (G)$ denote the domination number of $G$ , i.e. the cardinality of a smallest set of vertices $S$ such that every vertex of $G$ is either in $S$ or adjacent…

math.CO2018

Cycle Traversability for Claw-free Graphs and Polyhedral Maps

Ervin Győri, Michael D. Plummer, Dong Ye +1

Let $G$ be a graph, and $v \in V (G)$ and $S \subseteq V (G) \ v$ of size at least $k$ . An important result on graph connectivity due to Perfect states that, if $v$ and $S$ are…

math.CO2017

Toughness and spanning trees in $K_{4}$ -minor-free graphs

M. N. Ellingham, Songling Shan, Dong Ye +1

For an integer $k$ , a $k$ -tree is a tree with maximum degree at most $k$ . More generally, if $f$ is an integer-valued function on vertices, an $f$ -tree is a tree in which each vert…

math.CO2016

Connectivity and $W_{v}$ -Paths in Polyhedral Maps on Surfaces

Michael D. Plummer, Dong Ye, Xiaoya Zha

The $W_{v}$ -Path Conjecture due to Klee and Wolfe states that any two vertices of a simple polytope can be joined by a path that does not revisit any facet. This is equivalent to the…

math.CO2016

Quadrangular embeddings of complete graphs and the Even Map Color Theorem (with details)

Wenzhong Liu, Serge Lawrencenko, Beifang Chen +5

Hartsfield and Ringel constructed orientable quadrangular embeddings of the complete graph $K_{n}$ for $n \equiv 5 (mod 8)$ , and nonorientable ones for $n \geq 9$ and $n\equiv 1 \pmod…

math.CO2015

Thickness and Outerthickness for Embedded Graphs

Baogang Xu, Xiaoya Zha

We consider the thickness $θ (G))$ and outerthickness $θ_{o} (G)$ of a graph G in terms of its orientable and nonorientable genus. Dean and Hutchinson provided upper bounds for thickne…