Uniform {<i>C</i><sub>h</sub>,<i>S</i>(<i>C</i><sub>h</sub>)}-Factorizations of <i>K</i><sub>n</sub>−<i>I</i> for Even <i>h</i>
Let <i>H</i> be a connected subgraph of a graph <i>G</i>. An <i>H</i>-factor of <i>G</i> is a spanning subgraph of <i>G</i> whose components are isomorphic to <i>H</i>. Given a set <inline-formula><math xmlns="http...
| 发表在: | Mathematics |
|---|---|
| Main Authors: | , , |
| 格式: | 文件 |
| 语言: | 英语 |
| 出版: |
MDPI AG
2023-08-01
|
| 主题: | |
| 在线阅读: | https://www.mdpi.com/2227-7390/11/16/3479 |
