\(\beta \)-degree closures for graphs

DOI10.1016/j.disc.2008.07.036zbMath1210.05073OpenAlexW2013381657MaRDI QIDQ1025908

Ahmed Ainouche

Publication date: 23 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.07.036

zbMATH Keywords

stabilitydegree sequencecyclabilityclosurehamiltonicity\(k\)-leaf-connected

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07) Graph operations (line graphs, products, etc.) (05C76)

Related Items

\(\alpha\)-degree closures for graphs, \(\beta\)-neighborhood closures for graphs, Dirac's type sufficient conditions for hamiltonicity and pancyclicity

Cites Work

• Unnamed Item
• Semi-independence number of a graph and the existence of Hamiltonian circuits
• Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
• More powerful closure operations on graphs
• A method in graph theory
• A closure concept based on neighborhood unions of independent triples
• 0-dual closures for several classes of graphs
• Closure concepts: A survey
• Extension of several sufficient conditions for Hamiltonian graphs