D. Ye

activity

20082025

most citedExtremal fullerene graphs with the maximum Clar number

35 citations · 90 across the 23 of their papers we have counts for

collaborators

23 papers

math.CO2025

Packing Independent Cliques in $K_{4}$ -minor-free Graphs

Benjamin Xiao, Dong Ye

Let $G$ be a graph and $S$ be a set of cliques of $G$ . The set $S$ is an indeque set if every component of $G [S]$ , the subgraph induced by vertices of $S$ , is a clique. In this pap…

math.CO2023

On Sign-Invertible Graphs

Isaiah Osborne, Dong Ye

Let $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency ma…

math.CO2021

The number of cliques in graphs covered by long cycles

Naidan Ji, Dong Ye

Let $G$ be a 2-connected $n$ -vertex graph and $N_{s} (G)$ be the total number of $s$ -cliques in $G$ . Let $k \geq 4$ and $s \geq 2$ be integers. In this paper, we show that if $G$ has an e…

math.CO2021

Minimal quadrangulations of surfaces

Wenzhong Liu, M. N. Ellingham, Dong Ye

A quadrangular embedding of a graph in a surface $Σ$ , also known as a quadrangulation of $Σ$ , is a cellular embedding in which every face is bounded by a $4$ -cycle. A quadrangulati…

math.CO2019★ 1 cited

Connectivity for Kite-Linked Graphs

Chris Stephens, Dong Ye

For a given graph $H$ , a graph $G$ is $H$ -linked if, for every injection $φ : V (H) \to V (G)$ , the graph $G$ contains a subdivision of $H$ with $φ (v)$ corresponding to $v$ , for each…

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…