Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9512140 | Discrete Mathematics | 2005 | 14 Pages |
Abstract
A graph G is said to be cyclable if for each orientation D of G, there exists a set S(D)âV(G) such that reversing all the arcs with one end in S results in a hamiltonian digraph. Let G be 4-connected simple graph of even order n⩾14. In this paper, we show that if max{d(u),d(v)}⩾(n+1)/2 for any u,vâV(G) with d(u,v)=2, then G is cyclable.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yunqing Zhang, Yaojun Chen,