Ore and Erdős type conditions for long cycles in balanced bipartite graphs
2009 ◽
Vol Vol. 11 no. 2
(Graph and Algorithms)
◽
Graphs and Algorithms International audience We conjecture Ore and Erdős type criteria for a balanced bipartite graph of order 2n to contain a long cycle C(2n-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 well.
2009 ◽
Vol Vol. 11 no. 2
(Graph and Algorithms)
◽
Keyword(s):
2014 ◽
Vol Vol. 16 no. 3
◽
Keyword(s):
2013 ◽
Vol Vol. 15 no. 2
(Graph Theory)
◽
2016 ◽
Vol Vol. 17 no. 3
(Graph Theory)
◽
Keyword(s):
2015 ◽
Vol Vol. 17 no. 1
(Graph Theory)
◽
Keyword(s):
2014 ◽
Vol Vol. 16 no. 1
(Analysis of Algorithms)
◽
2010 ◽
Vol Vol. 12 no. 1
◽
Keyword(s):
1985 ◽
Vol 38
(2)
◽
pp. 118-131
◽
2013 ◽
Vol 22
(5)
◽
pp. 783-799
◽