On the length of longest dominating cycles in graphs
type: Item
instance of: scholarly article
title: On the length of longest dominating cycles in graphs
zbMATH Open document ID: 0783.05066
DOI: 10.1016/0012-365X(93)90554-7
published in: Discrete Mathematics
publication date: 1994-01-24T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 473132
zbMATH Keywords: dominating cycle
zbMATH Keywords: longest cycle
zbMATH Keywords: 1-tough cycle-dominable graph
zbMATH Keywords: bounds
author: Vũ Đình Hòa
MaRDI profile type: Publication
cites work: Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
cites work: Über Hamiltonsche Kreise und unabhängige Ecken in Graphen
cites work: Q5628163
cites work: Q3820627
cites work: Long cycles in graphs with large degree sums
cites work: A generalization of a result of Häggkvist and Nicoghossian
cites work: Q4187840
cites work: Tough graphs and Hamiltonian circuits.
cites work: Ein Struktursatz für 2-fach zusammenhängende Graphen mit großer Minimalvalenz
cites work: Q4858942
Recommended article: Q3744188
Recommended article: Q5453928
Recommended article: Long dominating cycles in graphs
Recommended article: Q4858942
Recommended article: Q3480078
Recommended article: Q4849520
Recommended article: A note on a longest cycle which is vertex dominating
Recommended article: Circumference of a graph and its distance dominating longest cycles
Recommended article: On the Intersections of Longest Cycles in a Graph
description: scientific article; zbMATH DE number 473132