Minimum forcing numbers of perfect matchings of circular and prismatic graphs
[Submitted on 16 Feb 2025 (v1), last revised 7 Jul 2026 (this ve
·
2025-02-16
·
via math.CO updates on arXiv.org
arXiv:2502.10981v2 Announce Type: replace Abstract: Let $G$ be a graph with a perfect matching. Denote by $f(…
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。