当前位置:
X-MOL 学术
›
Discret. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Every 3-connected {K1,3,Z7}-free graph of order at least 21 is Hamilton-connected
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-02-25 , DOI: 10.1016/j.disc.2021.112350 Zdeněk Ryjáček , Petr Vrána
中文翻译:
每3个连接 至少21的自由图是Hamilton连接的
更新日期:2021-02-26
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-02-25 , DOI: 10.1016/j.disc.2021.112350 Zdeněk Ryjáček , Petr Vrána
For an integer , is the graph obtained by attaching an endvertex of a path of length to a vertex of a triangle. We prove that every 3-connected -free graph is Hamilton-connected, with one exceptional graph. The result is sharp.
中文翻译:
每3个连接 至少21的自由图是Hamilton连接的
对于整数 , 是通过附加长度路径的端点顶点获得的图 到三角形的顶点。我们证明每3个连接自由图是汉密尔顿连接的,带有一个例外图。结果很清晰。