Forbidden pairs and the existence of a dominating cycle
Combinatorics
2015-02-10 v1
Abstract
A cycle in a graph is called dominating if every edge of the graph is incident with a vertex of the cycle. In this paper, we investigate forbidden pairs guaranteeing the existence of a dominating cycle in 2-connected graphs.
Cite
@article{arxiv.1502.02159,
title = {Forbidden pairs and the existence of a dominating cycle},
author = {Shuya Chiba and Michitaka Furuya and Shoichi Tsuchiya},
journal= {arXiv preprint arXiv:1502.02159},
year = {2015}
}
Comments
19 pages, 11 figures