The following pages link to Closure concepts: A survey (Q1972320):
Displaying 26 items.
- A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence (Q626786) (← links)
- How many conjectures can you stand? A survey (Q659764) (← links)
- Closure and spanning \(k\)-trees (Q742606) (← links)
- Closure concept for 2-factors in claw-free graphs (Q968436) (← links)
- The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs (Q973108) (← links)
- \(\beta \)-degree closures for graphs (Q1025908) (← links)
- Closure, stability and iterated line graphs with a 2-factor (Q1044973) (← links)
- Stable properties of graphs (Q1175986) (← links)
- Cycles through given vertices and closures (Q1422413) (← links)
- A note on computing graph closures (Q1422436) (← links)
- Closure systems and their structure (Q1602560) (← links)
- Vertex pancyclic graphs (Q1613376) (← links)
- Spectral results on Hamiltonian problem (Q1999737) (← links)
- Closure and spanning trees with bounded total excess (Q2045377) (← links)
- Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs (Q2227978) (← links)
- Systematization of a set of closure techniques (Q2261818) (← links)
- Closure operation for even factors on claw-free graphs (Q2275395) (← links)
- Stability theorems for graph vulnerability parameters (Q2657079) (← links)
- An introduction to tight closure (Q2717187) (← links)
- Stability of hereditary graph classes under closure operations (Q2852612) (← links)
- The complete closure of a graph (Q3137765) (← links)
- (Q3300689) (← links)
- (Q3339328) (← links)
- Closure and stable Hamiltonian properties in claw-free graphs (Q4487073) (← links)
- A closure lemma for tough graphs and Hamiltonian degree conditions (Q6197740) (← links)
- Closure results for arbitrarily partitionable graphs (Q6642846) (← links)
