3 papers
math.CO2025
A note on two cycles of consecutive even lengths in graphs
Binlong Li, Yufeng Pan, Lingjuan Shi
Bondy and Vince proved that a graph of minimum degree at least three contains two cycles whose lengths differ by one or two, which was conjectured by ErdÅs. Gao, Li, Ma and Xie ga…
math.CO2025
The number of maximal matchings in polygon rings
Chengqi Li, Jinhui Yin, Lingjuan Shi
A matching of graph is maximal if it cannot be expanded by adding any edge to create a larger matching. In this paper, for a hexagonal ring with hexagons, we show that…
math.CO2025
On the maximal matchings of trees
Lingjuan Shi, Wei Li, Kai Deng
An independent edge set of graph is a matching, and is maximal if it is not a proper subset of any other matching of . The number of all the maximal matchings of is deno…