Closure concepts: A survey

DOI10.1007/S003730050002zbMath0946.05051OpenAlexW1992966703MaRDI QIDQ1972320

Ingo Schiermeyer, Zdeněk Ryjáček, Hajo J. Broersma

Publication date: 18 October 2000

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730050002

zbMATH Keywords

Hamiltonianclosure

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (19)

Vertex pancyclic graphs ⋮ Unnamed Item ⋮ Stability theorems for graph vulnerability parameters ⋮ On the minimum cycle cover problem on graphs with bounded co-degeneracy ⋮ A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence ⋮ A closure lemma for tough graphs and Hamiltonian degree conditions ⋮ Cycles through given vertices and closures ⋮ A note on computing graph closures ⋮ How many conjectures can you stand? A survey ⋮ Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs ⋮ Spectral results on Hamiltonian problem ⋮ Closure concept for 2-factors in claw-free graphs ⋮ The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs ⋮ Closure operation for even factors on claw-free graphs ⋮ Closure and spanning trees with bounded total excess ⋮ Closure and spanning \(k\)-trees ⋮ \(\beta \)-degree closures for graphs ⋮ Closure, stability and iterated line graphs with a 2-factor ⋮ Stability of Hereditary Graph Classes Under Closure Operations

This page was built for publication: Closure concepts: A survey