Dominating cycles in regular 3-connected graphs

14Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Let G be a 3-connected, k-regular graph on at most 4k vertices. We show that, for k≥63, every longest cycle of G is a dominating cycle. We conjecture that G is in fact hamiltonian. © 1992.

Cite

CITATION STYLE

APA

Jackson, B., Li, H., & Zhu, Y. (1992). Dominating cycles in regular 3-connected graphs. Discrete Mathematics, 102(2), 163–176. https://doi.org/10.1016/0012-365X(92)90051-G

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free