In this note, we consider the problem of generating $k$-factorable graphic sequences with connected (resp. no connected) $k$-factors.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。
