10 citations · 13 across the 9 of their papers we have counts for
9 papers
Dominating maximal outerplane graphs and Hamiltonian plane triangulations
Michael D. Plummer, Dong Ye, Xiaoya Zha
Let be a graph and denote the domination number of , i.e. the cardinality of a smallest set of vertices such that every vertex of is either in or adjacent…
Cycle Traversability for Claw-free Graphs and Polyhedral Maps
Ervin Győri, Michael D. Plummer, Dong Ye +1
Let be a graph, and and of size at least . An important result on graph connectivity due to Perfect states that, if and are…
Toughness and spanning trees in -minor-free graphs
M. N. Ellingham, Songling Shan, Dong Ye +1
For an integer , a -tree is a tree with maximum degree at most . More generally, if is an integer-valued function on vertices, an -tree is a tree in which each vert…
Connectivity and -Paths in Polyhedral Maps on Surfaces
Michael D. Plummer, Dong Ye, Xiaoya Zha
The -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…
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 for , and nonorientable ones for and $n\equiv 1 \pmod…
Thickness and Outerthickness for Embedded Graphs
Baogang Xu, Xiaoya Zha
We consider the thickness and outerthickness of a graph G in terms of its orientable and nonorientable genus. Dean and Hutchinson provided upper bounds for thickne…
Partial duality and closed 2-cell embeddings
M. N. Ellingham, Xiaoya Zha
In 2009 Chmutov introduced the idea of partial duality for embeddings of graphs in surfaces. We discuss some alternative descriptions of partial duality, which demonstrate the symm…
Dominating Plane Triangulations
Michael D. Plummer, Dong Ye, Xiaoya Zha
In 1996, Tarjan and Matheson proved that if is a plane triangulated disc with vertices, , where denotes the domination number of . Furthermore, they…
Orientable embeddings and orientable cycle double covers of projective-planar graphs
M. N. Ellingham, Xiaoya Zha
In a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bounded by a cycle in the graph. The Orientable Strong Embedding Conjecture says that every…