More powerful closure operations on graphs

DOI10.1016/0012-365X(91)90049-8MaRDI QIDQ1174165zbMATH OpenOpenAlexFDO

Authors Feng Tian, Xiaotie Deng, Yongjin Zhu

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

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

Recommendations

• \(\alpha\)-degree closures for graphs
• Subgraphs, closures and hamiltonicity
• Two theorems on Hamiltonian graphs
• Stable properties of graphs

Cites work

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

Cited in

(15)

• Stable properties of graphs
• A note on \(K_ 4\)-closures in hamiltonian graph theory
• Generalization of matching extensions in graphs. IV: Closures
• \(\beta \)-degree closures for graphs
• scientific article; zbMATH DE number 205342 (Why is no real title available?)
• Closures, cycles, and paths
• Computation of the 0-dual closure for hamiltonian graphs
• scientific article; zbMATH DE number 398961 (Why is no real title available?)
• Extension of several sufficient conditions for Hamiltonian graphs
• \(\alpha\)-degree closures for graphs
• Two theorems on Hamiltonian graphs
• scientific article; zbMATH DE number 1509533 (Why is no real title available?)
• Subgraphs, closures and hamiltonicity
• Closure results for arbitrarily partitionable graphs
• Edge closures of Hamiltonian type

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1174165)