当前位置:
X-MOL 学术
›
SIAM J. Discret. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Sublinear Longest Path Transversals
SIAM Journal on Discrete Mathematics ( IF 0.8 ) Pub Date : 2021-07-27 , DOI: 10.1137/20m1362577 James A. Long , Kevin G. Milans , Andrea Munaro
SIAM Journal on Discrete Mathematics ( IF 0.8 ) Pub Date : 2021-07-27 , DOI: 10.1137/20m1362577 James A. Long , Kevin G. Milans , Andrea Munaro
SIAM Journal on Discrete Mathematics, Volume 35, Issue 3, Page 1673-1677, January 2021.
We show that connected graphs admit sublinear longest path transversals. This improves an earlier result of Rautenbach and Sereni and is related to the fifty-year-old question of whether connected graphs admit longest path transversals of constant size. The same technique allows us to show that 2-connected graphs admit sublinear longest cycle transversals.
中文翻译:
次线性最长路径横向
SIAM Journal on Discrete Mathematics,第 35 卷,第 3 期,第 1673-1677 页,2021 年 1 月。
我们表明连通图允许亚线性最长路径横向。这改进了 Rautenbach 和 Sereni 的早期结果,并且与 50 年前的问题有关,即连通图是否允许恒定大小的最长路径横向。相同的技术使我们能够证明 2-连通图允许亚线性最长循环横向。
更新日期:2021-07-27
We show that connected graphs admit sublinear longest path transversals. This improves an earlier result of Rautenbach and Sereni and is related to the fifty-year-old question of whether connected graphs admit longest path transversals of constant size. The same technique allows us to show that 2-connected graphs admit sublinear longest cycle transversals.
中文翻译:
次线性最长路径横向
SIAM Journal on Discrete Mathematics,第 35 卷,第 3 期,第 1673-1677 页,2021 年 1 月。
我们表明连通图允许亚线性最长路径横向。这改进了 Rautenbach 和 Sereni 的早期结果,并且与 50 年前的问题有关,即连通图是否允许恒定大小的最长路径横向。相同的技术使我们能够证明 2-连通图允许亚线性最长循环横向。