2 papers
math.CO2026
The number of perfect matchings in 3-connected planar graphs
Wuxian Chen, Xinyu Dai, Fuliang Lu
A graph is matchable if it admits a perfect matching. Recently, Goedgebeur et al. asked whether there exists a constant such that infinitely many matchable planar -connec…
math.CO2025
Nice vertices in cubic graphs
Wuxian Chen, Fuliang Lu, Heping Zhang
A subgraph of a graph is nice if has a perfect matching. Nice subgraphs play a vital role in the theory of ear decomposition and matching minors of matching cove…