Paper Info
Title
On a 2-factor with a specified edge in a graph satisfying the Ore condition
Abstract
Let k be an integer greater than one, and let G be a simple graph with at least 4k + 1 vertices. In this article, we prove that if σ2(G) ≥ |V(G)|, then for an edge e of G, there exists a 2-factor with k cycles that contains e, or |V(G)| is even and G has a vertex cover of size |V(G)|/2 containing the endpoints of e. Here σ2(G) is the minimum degree sum for a pair of nonadjacent vertices.
Year
DOI
Venue
2002
10.1016/S0012-365X(02)00506-X
Discrete Mathematics
Keywords
Field
DocType
ore condition,ore type condition,k cycle,vertex cover,edge e,2-factors,nonadjacent vertex,a specified edge,simple graph,specified edge,minimum degree sum,satisfiability
Discrete mathematics,Combinatorics,Bound graph,Vertex (geometry),Graph power,Hamiltonian path,Ore condition,Neighbourhood (graph theory),Cycle graph,Vertex cover,Mathematics
Journal
Volume
Issue
ISSN
257
2-3
Discrete Mathematics
Citations 
PageRank 
References 
6
0.52
3
Authors
2
Name
Order
Citations
PageRank
Atsushi Kaneko116924.21
Kiyoshi Yoshimoto213322.65