-neighborhood closures for graphs
From MaRDI portal
Publication:1025907
DOI10.1016/J.DISC.2008.06.016zbMATH Open1210.05070OpenAlexW2054426344MaRDI QIDQ1025907FDOQ1025907
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.06.016
Recommendations
Cites Work
- Graph theory
- A Short Proof of the Factor Theorem for Finite Graphs
- A method in graph theory
- Title not available (Why is that?)
- \(\beta \)-degree closures for graphs
- Semi-independence number of a graph and the existence of Hamiltonian circuits
- \(\alpha\)-degree closures for graphs
- Computation of the 0-dual closure for hamiltonian graphs
- 0-dual closures for several classes of graphs
- Relaxations of Ore's condition on cycles
- Extension of several sufficient conditions for Hamiltonian graphs
Cited In (10)
- Title not available (Why is that?)
- On k-closure operators in graphs
- Title not available (Why is that?)
- Iterated neighborhood graphs
- Title not available (Why is that?)
- A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence
- Title not available (Why is that?)
- \(\alpha\)-degree closures for graphs
- Some more results on total closed neighborhood graphs
- \(\beta \)-degree closures for graphs
This page was built for publication: \(\beta\)-neighborhood closures for graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025907)