生成最小度为三且大围长的有限图集的禁止子图
组合数学
2024-04-18 v1
摘要
对于图族,若图不包含中任何成员作为诱导子图,则称为-free。令表示所有最小度至少为3的连通-free图族。本文刻画了直径至少为7的非毛毛虫树,使得是有限族,其中是阶圈。
引用
@article{arxiv.2404.10996,
title = {Forbidden subgraphs generating a finite set of graphs with minimum degree three and large girth},
author = {Yoshimi Egawa and Michitaka Furuya},
journal= {arXiv preprint arXiv:2404.10996},
year = {2024}
}
备注
31 pages, 19 figures