\(\beta\)-neighborhood closures for graphs
From MaRDI portal
Publication:1025907
DOI10.1016/j.disc.2008.06.016zbMath1210.05070MaRDI QIDQ1025907
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
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- \(\alpha\)-degree closures for graphs
- Computation of the 0-dual closure for hamiltonian graphs
- \(\beta \)-degree closures for graphs
- Semi-independence number of a graph and the existence of Hamiltonian circuits
- A method in graph theory
- 0-dual closures for several classes of graphs
- Relaxations of Ore's condition on cycles
- Extension of several sufficient conditions for Hamiltonian graphs
- A Short Proof of the Factor Theorem for Finite Graphs