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.
机构:
Ningxia Univ, Sch Math & Comp Sci, Yinchuan 750021, Peoples R China
Xiamen Univ, Sch Math Sci, Xiamen 361005, Peoples R ChinaNingxia Univ, Sch Math & Comp Sci, Yinchuan 750021, Peoples R China
机构:
Department of Mathematics & Statistics, American University of Sharjah, United Arab Emirates
Department of Computer Science, American University of Sharjah, United Arab EmiratesDepartment of Mathematics & Statistics, American University of Sharjah, United Arab Emirates
机构:
Department of Mathematics & Statistics, American University of Sharjah, United Arab Emirates
Department of Computer Science, American University of Sharjah, United Arab EmiratesDepartment of Mathematics & Statistics, American University of Sharjah, United Arab Emirates