More powerful closure operations on graphs

DOI10.1016/0012-365X(91)90049-8zbMath0753.05077OpenAlexW2093776401MaRDI QIDQ1174165

Feng Tian, Xiaotie Deng, Yung-ching Chu

Publication date: 25 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90049-8

zbMATH Keywords

closure operationsgraph properties

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Subgraphs, closures and hamiltonicity ⋮ Computation of the 0-dual closure for hamiltonian graphs ⋮ \(\beta \)-degree closures for graphs ⋮ A note on \(K_ 4\)-closures in hamiltonian graph theory

Cites Work

• Unnamed Item
• Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
• A method in graph theory
• Note on Hamilton Circuits

This page was built for publication: More powerful closure operations on graphs