Back to Search
Start Over
A fan-type condition for cyclability
- Source :
-
Discrete Mathematics . Dec2005, Vol. 305 Issue 1-3, p323-336. 14p. - Publication Year :
- 2005
-
Abstract
- Abstract: A graph G is said to be cyclable if for each orientation D of G, there exists a set 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 . In this paper, we show that if for any with , then G is cyclable. [Copyright &y& Elsevier]
- Subjects :
- *COMPUTATIONAL mathematics
*GRAPH theory
*GRAPHIC methods
*MATHEMATICS
Subjects
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 305
- Issue :
- 1-3
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 19185712
- Full Text :
- https://doi.org/10.1016/j.disc.2005.08.003