1 citations · 2 across the 6 of their papers we have counts for
7 papers · 1 filter
On minimal k-factor-critical planar graphs
Qiuli Li, Fuliang Lu, Heping Zhang
A graph of order is said to be \emph{-factor-critical} () if the removal of any vertices results in a graph with a perfect matching. A -factor-critical gr…
The minimum degree of minimal -factor-critical claw-free graphs*
Jing Guo, Qiuli Li, Fuliang Lu +1
A graph of order is said to be -factor-critical for integers , if the removal of any vertices results in a graph with a perfect matching. A -factor-cr…
On the anti-Kelulé problem of cubic graphs
Qiuli Li, Wai Chee Shiu, Pak Kiu Sun +1
An edge set of a connected graph is called an anti-Kekulé set if is connected and has no perfect matchings, where denotes the subgraph obtained by deleting all…
Classification of 2-extendable bipartite and cubic non-bipartite vertex-transitive graphs
Qiuli Li, Xing Gao
In \cite{Chan95}, the authors classified the 2-extendable abelian Cayley graphs and posed the problem of characterizing all 2-extendable Cayley graphs. We first show that a connect…
Matching preclusion for vertex-transitive networks
Qiuli Li, Jinghua He, Heping Zhang
In interconnection networks, matching preclusion is a measure of robustness when there is a link failure. Let be a graph of even order. The matching preclusion number i…
Fullerenes with the maximum Clar number
Yang Gao, Qiuli Li, Heping Zhang
The Clar number of a fullerene is the maximum number of independent resonant hexagons in the fullerene. It is known that the Clar number of a fullerene with n vertices is bounded a…
On the restricted matching of graphs in surfaces
Qiuli Li, Heping Zhang
A connected graph with at least vertices is said to have property if, for any two disjoint matchings and of size and respectively, has a…