Spanning trails with maximum degree at most 4 in $2K_2$-free graphs
Combinatorics
2016-09-29 v1
Abstract
A graph is called -free if it does not contain two independent edges as an induced subgraph. Mou and Pasechnik conjectured that every -tough -free graph with at least three vertices has a spanning trail with maximum degree at most . In this paper, we confirm this conjecture. We also provide examples for all of -tough graphs that do not have a spanning trail with maximum degree at most .
Keywords
Cite
@article{arxiv.1609.08730,
title = {Spanning trails with maximum degree at most 4 in $2K_2$-free graphs},
author = {Guantao Chen and M. N. Ellingham and Akira Saito and Songling Shan},
journal= {arXiv preprint arXiv:1609.08730},
year = {2016}
}