Relaxations of Ore's condition on cycles

MaRDI QIDQ2500979zbMATH OpenFDO

Authors Ahmed Ainouche

Publication date 30 August 2006

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/126407, http://www.emis.de/journals/EJC/Volume_13/Abstracts/v13i1r60.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

characterizationHamiltonian

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Review text

Summary: A simple, undirected \(2\)-connected graph \(G\) of order \(n\) belongs to class \({\mathcal O}(n\),\(\varphi)\), \(\varphi\geq0\), if \(\sigma_{2}=n-\varphi.\) It is well known (Ore's theorem) that \(G\) is Hamiltonian if \(\varphi= 0\), in which case the \(2\)-connectedness hypothesis is implied. In this paper we provide a method for studying this class of graphs. As an application we give a full characterization of graphs \(G\) in \({\mathcal O}(n\),\(\varphi)\), \(\varphi\leq3\), in terms of their dual Hamiltonian closure.

Recommendations

• Extensions of Bondy's theorem on cycles in 2-connected graphs
• scientific article; zbMATH DE number 4144018
• Closures, cycles, and paths
• scientific article; zbMATH DE number 4087697
• The graphs satisfying conditions of Ore's type

Cited in

(4)

• \(\beta\)-neighborhood closures for graphs
• Closures, cycles, and paths
• Extensions of Bondy's theorem on cycles in 2-connected graphs
• scientific article; zbMATH DE number 4144018 (Why is no real title available?)

This page was built for publication: Relaxations of Ore's condition on cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500979)