-degree closures for graphs
From MaRDI portal
Publication:1025908
DOI10.1016/J.DISC.2008.07.036zbMATH Open1210.05073OpenAlexW2013381657MaRDI QIDQ1025908FDOQ1025908
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
Recommendations
Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Graph theory
- A method in graph theory
- Closure concepts: A survey
- 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 closure concept based on neighborhood unions of independent triples
- More powerful closure operations on graphs
- 0-dual closures for several classes of graphs
- Extension of several sufficient conditions for Hamiltonian graphs
Cited In (11)
- Title not available (Why is that?)
- A note on the computation on the k-closure of a graph
- On k-closure operators in graphs
- The complete closure of a graph
- Title not available (Why is that?)
- 0-dual closures for several classes of graphs
- \(\beta\)-neighborhood closures for graphs
- Dirac's type sufficient conditions for hamiltonicity and pancyclicity
- Title not available (Why is that?)
- \(\alpha\)-degree closures for graphs
- Title not available (Why is that?)
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)