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

Showing 2017 · math.COShow all

4 papers · 2 filters

math.CO2017★ 1 cited

On the anti-Kelulé problem of cubic graphs

Qiuli Li, Wai Chee Shiu, Pak Kiu Sun +1

An edge set $S$ of a connected graph $G$ is called an anti-Kekulé set if $G - S$ is connected and has no perfect matchings, where $G - S$ denotes the subgraph obtained by deleting all…

math.CO2017★ 7 cited

Resonance Graphs and Perfect Matchings of Graphs on Surfaces

Niko Tratnik, Dong Ye

Let $G$ be a graph embedded in a surface and let $F$ be a set of even faces of $G$ (faces bounded by a cycle of even length). The resonance graph of $G$ with respect to $\…

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.CO2017

On Perfect Matchings in Matching Covered Graphs

Jinghua He, Erling Wei, Dong Ye +1

Let $G$ be a matching-covered graph, i.e., every edge is contained in a perfect matching. An edge subset $X$ of $G$ is feasible if there exists two perfect matchings $M_{1}$ and $M_2…

On the anti-Kelulé problem of cubic graphs

Resonance Graphs and Perfect Matchings of Graphs on Surfaces

Toughness and spanning trees in K4​-minor-free graphs

On Perfect Matchings in Matching Covered Graphs

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