Results 1 
2 of
2
Ore and Erdős type conditions for long cycles in balanced bipartite graphs
"... We conjecture Ore and Erdős type criteria for a balanced bipartite graph of order 2n to contain a long cycle C2n−2k, where 0 ≤ k < n/2. For k = 0, these are the classical hamiltonicity criteria of Moon and Moser. The main two results of the paper assert that our conjectures hold for k = 1 as wel ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We conjecture Ore and Erdős type criteria for a balanced bipartite graph of order 2n to contain a long cycle C2n−2k, where 0 ≤ k < n/2. For k = 0, these are the classical hamiltonicity criteria of Moon and Moser. The main two results of the paper assert that our conjectures hold for k = 1
Closure Concepts  a Survey
 Graphs and Combinatorics
"... In this paper we survey results of the following type (known as closure results). Let P be a graph property, and let C(u; v) be a condition on two nonadjacent vertices u and v of a graph G. Then G+uv has property P if and only if G has property P . The first and now wellknown result of this type ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
In this paper we survey results of the following type (known as closure results). Let P be a graph property, and let C(u; v) be a condition on two nonadjacent vertices u and v of a graph G. Then G+uv has property P if and only if G has property P . The first and now wellknown result