SUBLINEAR LONGEST PATH TRANSVERSALS

被引:2
|
作者
Long, James A. [1 ]
Milans, Kevin G. [1 ]
Munaro, Andrea [2 ]
机构
[1] West Virginia Univ, Dept Math, Morgantown, WV 26505 USA
[2] Queens Univ Belfast, Sch Math & Phys, Belfast BT7 1NN, Antrim, North Ireland
关键词
longest path; longest cycle; transversal; maximum subdivision;
D O I
10.1137/20M1362577
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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.
引用
收藏
页码:1673 / 1677
页数:5
相关论文
共 50 条