5 citations · 5 across the 6 of their papers we have counts for
9 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…
Bricks that every removable edge is solitary
Jinxin Xue, Jun Ge, Fuliang Lu +1
A brick is a 3-connected graph such that has a perfect matching for any two distinct vertices . An edge in a matching covered graph is removable if…
Near-bipartite bricks in which every b-invariant edge is a forcing edge
Yaxian Zhang, Fuliang Lu
A connected graph is matching covered if it has at least one edge and every edge lies in some perfect matching.Lovász proved that every matching covered graph G can be uniquely dec…
Bricks in which every vertex is incident with a forcing edge
Xinyu Dai, Fuliang Lu, Yaxian Zhang
A matching covered graph is a brick if it is 3-connected and bicritical. An edge of a matching covered graph G is a forcing edge if it lies in precisely one perfect matching of G.…
Excluded conformal minors of Birkhoff-von Neumann graphs with equal global forcing number and maximum anti-forcing number
Yaxian Zhang, Yan Wu, Heping Zhang
Global forcing number and maximum anti-forcing number of matchable graphs (graphs with a perfect matching) were proposed in completely different situations with applications in the…
The maximum forcing numbers of quadriculated tori
Qianqian Liu, Yaxian Zhang, Heping Zhang
Klein and Randic (1985) proposed the concept of forcing number, which has an application in chemical resonance theory. Let be a graph with a perfect matching . The forcing n…
Cubic bricks that every b-invariant edge is forcing
Yaxian Zhang, Fuliang Lu, Heping Zhang
A connected graph G is matching covered if every edge lies in some perfect matching of G. Lovasz proved that every matching covered graph G can be uniquely decomposed into a list o…
Components of domino tilings under flips in quadriculated tori
Qianqian Liu, Yaxian Zhang, Heping Zhang
In a region R consisting of unit squares, a (domino) tiling is a collection of dominoes (the union of two adjacent squares) which pave fully the region. The flip graph of R is defi…
Relations between global forcing number and maximum anti-forcing number of a graph
Yaxian Zhang, Heping Zhang
The global forcing number of a graph G is the minimal cardinality of an edge subset discriminating all perfect matchings of G, denoted by gf(G). For any perfect matching M of G, th…