activity
20102019
most citedDecomposition theorem on matchable distributive lattices

11 citations · 18 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2019

Some enumerative properties of a class of Fibonacci-like cubes

Xuxu Zhao, Xu Wang, Haiyuan Yao

A filter lattice is a distributive lattice formed by all filters of a poset in the anti-inclusion order. We study the combinatorial properties of the Hasse diagrams of filter latti…

math.CO2018

Optimal cube factors of Fibonacci and matchable Lucas cubes

Xu Wang, Xuxu Zhao, Haiyuan Yao

The optimal cube factor of a graph, a special kind of component factor, is first introduced. Furthermore, the optimal cube factors of Fibonacci and matchable Lucas cubes are studie…

math.CO2018

A class of non-matchable distributive lattices

Xu Wang, Xuxu Zhao, Haiyuan Yao

The set of all perfect matchings of a plane (weakly) elementary bipartite graph equipped with a partial order is a poset, moreover the poset is a finite distributive lattice and it…

math.CO2018★ 3 cited

Structure and enumeration results of matchable Lucas cubes

Xu Wang, Xuxu Zhao, Haiyuan Yao

A lucasene is a hexagon chain that is similar to a fibonaccene, an -fence is a poset the Hasse diagram of which is isomorphic to the directed inner dual graph of the correspondi…

math.CO2018★ 4 cited

Convex expansion for finite distributive lattices with applications

Xu Wang, Xuxu Zhao, Haiyuan Yao

The concept of cutting is first explicitly introduced. By the concept, a convex expansion for finite distributive lattices is considered. Thus, a more general method for drawing th…

math.CO2010★ 11 cited

Decomposition theorem on matchable distributive lattices

Heping Zhang, Dewu Yang, Haiyuan Yao

A distributive lattice structure has been established on the set of perfect matchings of a plane bipartite graph . We call a lattice {\em matchable distributive…