A note on the computation on the k-closure of a graph

DOI10.1016/0020-0190(87)90148-7zbMath0653.68072OpenAlexW2028291445MaRDI QIDQ1108040

Jayme Luiz Szwarcfiter

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90148-7

zbMATH Keywords

Hamilton cyclesclosure of graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Related Items (1)

A note on computing graph closures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
• A method in graph theory
• On Hamilton's ideals
• Note on Hamilton Circuits
• Some Theorems on Abstract Graphs

This page was built for publication: A note on the computation on the k-closure of a graph