-neighborhood closures for graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4142080 (Why is no real title available?)
- 0-dual closures for several classes of graphs
- A Short Proof of the Factor Theorem for Finite Graphs
- A method in graph theory
- Computation of the 0-dual closure for hamiltonian graphs
- Extension of several sufficient conditions for Hamiltonian graphs
- Graph theory
- Relaxations of Ore's condition on cycles
- Semi-independence number of a graph and the existence of Hamiltonian circuits
- \(\alpha\)-degree closures for graphs
- \(\beta \)-degree closures for graphs
Cited in
(10)- scientific article; zbMATH DE number 6438523 (Why is no real title available?)
- A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence
- \(\beta \)-degree closures for graphs
- Iterated neighborhood graphs
- Some more results on total closed neighborhood graphs
- scientific article; zbMATH DE number 5367261 (Why is no real title available?)
- \(\alpha\)-degree closures for graphs
- scientific article; zbMATH DE number 1509533 (Why is no real title available?)
- On k-closure operators in graphs
- scientific article; zbMATH DE number 4142080 (Why is no real title available?)
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)
