\(\alpha\)-degree closures for graphs

DOI10.1016/J.DISC.2011.09.033zbMath1238.05223OpenAlexW4205766169MaRDI QIDQ658065

Ahmed Ainouche

Publication date: 11 January 2012

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

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

zbMATH Keywords

matching numberHamiltonicitydegree sequencecyclability\(k\)-leaf-connecteddual closureneighborhood closure

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

\(\beta\)-neighborhood closures for graphs

Cites Work

• Unnamed Item
• Unnamed Item
• \(\beta\)-neighborhood closures for graphs
• \(\beta \)-degree closures for 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
• A method in graph theory
• A closure concept based on neighborhood unions of independent triples
• Note on Hamilton Circuits
• Some Theorems on Abstract Graphs

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