An Ore-type condition for cyclability
type: Item
instance of: scholarly article
title: An Ore-type condition for cyclability
zbMATH Open document ID: 0993.05098
author: Yaojun Chen
author: Yunqing Zhang
author: Keming Zhang
published in: European Journal of Combinatorics
publication date: 2002-09-25T00:00:00Z
review text: A graph \(G\) is said to be cyclable if for each orientation \(D\) of \(G\), there is a set \(S(D)\subseteq V(G)\) such that reversing all arcs with one end in \(S(D)\) results in a Hamiltonian digraph. The authors show that if \(G\) is a simple graph of even order \(n\geq 8\), such that for each pair of non-adjacent vertices \(u,v\in V(G)\), \(d_G(u)+ d_G(v)\geq n+1\), then \(G\) is cyclable. The result is shown to be best possible as \(K_{2t+ 1,2t+1}\) is not cyclable for all \(t\geq 1\).
reviewed by: R. E. L. Aldred
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 1672641
zbMATH Keywords: Ore-type condition
zbMATH Keywords: cyclability
zbMATH Keywords: Hamiltonian digraph
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W1987976698
cites work: On deciding switching equivalence of graphs
cites work: Some Theorems on Abstract Graphs
cites work: Pushing vertices and orienting edges
cites work: Hamiltonicity and reversing arcs in digraphs
cites work: Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
cites work: Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
cites work: Q5591387
cites work: Note on Hamilton Circuits
cites work: On graphs that can be oriented as diagrams of ordered sets
cites work: On reorienting graphs by pushing down maximal vertices
cites work: Q3975130
cites work: On Ringeisen's isolation game
cites work: The isolation game for regular graphs
cites work: Reconstruction from vertex-switching
cites work: Switchings Constrained to 2-Connectivity in Simple Graphs
DOI: 10.1006/EUJC.2001.0517
Recommended article: A fan-type condition for cyclability
Recommended article: Neighborhood unions and cyclability of graphs
Recommended article: Q3052025
Recommended article: Hamiltonicity and reversing arcs in digraphs
Recommended article: Q3414887
description: scientific article; zbMATH DE number 1672641