1 citations · 1 across the 1 of their papers we have counts for
3 papers
math.CO2019★ 1 cited
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…
math.CO2018
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…
math.CO2016
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…