A note on \(K_ 4\)-closures in hamiltonian graph theory
type: Item
instance of: scholarly article
title: A note on \(K_ 4\)-closures in hamiltonian graph theory
zbMATH Open document ID: 0789.05057
DOI: 10.1016/0012-365X(93)90533-Y
published in: Discrete Mathematics
publication date: 1993-12-20T00:00:00Z
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 473111
zbMATH Keywords: hamiltonian graph
zbMATH Keywords: claw-free graph
author: Hajo Broersma
MaRDI profile type: Publication
cites work: Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
cites work: Semi-independence number of a graph and the existence of Hamiltonian circuits
cites work: A method in graph theory
cites work: Q5422499
cites work: Q3474676
cites work: Some localization theorems on Hamiltonian circuits
cites work: Computation of the 0-dual closure for hamiltonian graphs
cites work: Q3807250
cites work: A generalization of the Bondy-Chvátal theorem on the k-closure
cites work: More powerful closure operations on graphs
description: scientific article; zbMATH DE number 473111