-degree closures for graphs

DOI10.1016/J.DISC.2008.07.036MaRDI QIDQ1025908zbMATH OpenOpenAlexFDO

Authors 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

stabilityclosuredegree sequencecyclabilityhamiltonicity\(k\)-leaf-connected

Mathematics Subject Classification ID

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

Recommendations

• \(\alpha\)-degree closures for graphs
• \(\beta\)-neighborhood closures for graphs
• More powerful closure operations on graphs
• The \(*\)-closure for graphs and claw-free graphs
• The complete closure of a graph

Cites work

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

Cited in

(11)

• scientific article; zbMATH DE number 426157 (Why is no real title available?)
• scientific article; zbMATH DE number 398961 (Why is no real title available?)
• A note on the computation on the k-closure of a graph
• On k-closure operators in graphs
• The complete closure of a graph
• scientific article; zbMATH DE number 1509533 (Why is no real title available?)
• 0-dual closures for several classes of graphs
• \(\beta\)-neighborhood closures for graphs
• Dirac's type sufficient conditions for hamiltonicity and pancyclicity
• \(\alpha\)-degree closures for graphs
• scientific article; zbMATH DE number 5367261 (Why is no real title available?)

This page was built for publication: \(\beta \)-degree closures for graphs

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