Closure concepts: A survey
As the title indicates, this is a survey of results involving various types of closure conditions, where closure conditions involve adding an edge to a graph without changing the existence of some specified graphical property. Most of the graphical properties studied are hamiltonian type properties such as hamiltonian, panconnected, pancyclic, and cycle extendable, but other properties such as the existence of matchings are also studied. The Bondy-Chvátal closure, which started this line of investigation, is surveyed extensively along with the corresponding stability conditions. Results involving graphs with complete closures are also presented, as well as other related closure conditions such as the triple closure, \(0\)-dual closure, and neighborhood closure. For claw-free graphs, Ryjáček introduced a closure obtained by completing the neighborhoods of vertices with connected neighborhoods. Results using this closure are also described. This is a broad survey of ``closure results with an extensive list of references.
- \(\beta \)-degree closures for graphs
- Closure, stability and iterated line graphs with a 2-factor
- Stable properties of graphs
- Cycles through given vertices and closures
- A note on computing graph closures
- Closure systems and their structure
- Vertex pancyclic graphs
- Spectral results on Hamiltonian problem
- Closure and spanning trees with bounded total excess
- Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs
- Systematization of a set of closure techniques
- Closure operation for even factors on claw-free graphs
- Stability theorems for graph vulnerability parameters
- An introduction to tight closure
- Stability of hereditary graph classes under closure operations
- The complete closure of a graph
- On a spanning tree with specified leaves in a bipartite graph
- scientific article; zbMATH DE number 3872730 (Why is no real title available?)
- scientific article; zbMATH DE number 1509533 (Why is no real title available?)
- On the minimum cycle cover problem on graphs with bounded co-degeneracy
- A closure lemma for tough graphs and Hamiltonian degree conditions
- A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence
- How many conjectures can you stand? A survey
- Closure results for arbitrarily partitionable graphs
- An upper bound on path cover number of regular graphs and its application to Hamiltonian cycle in tough graphs
- New conditions for graph Hamiltonicity
- Closure and spanning \(k\)-trees
- Closure concept for 2-factors in claw-free graphs
- The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs
This page was built for publication: Closure concepts: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1972320)
