1 citations · 2 across the 6 of their papers we have counts for
8 papers
UMAS3D: Unified Mask-Free 3D Editing with Region-Adaptive Source Preservation
Xianlin Zeng, Xiaolong Shen, Ruijie Quan +1
3D editing aims to modify an existing 3D asset according to user intent while preserving geometry and appearance outside the intended edit region. Existing methods often rely on ta…
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…