An upper bound on the domination number of \(n\)-vertex connected cubic graphs
type: Item
instance of: scholarly article
title: An upper bound on the domination number of \(n\)-vertex connected cubic graphs
zbMATH Open document ID: 1179.05083
author: B. Y. Stodolsky
author: Alexandr Kostochka
published in: Discrete Mathematics
publication date: 2009-04-09T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5542434
zbMATH Keywords: cubic graphs
zbMATH Keywords: domination
zbMATH Keywords: connected graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2007.12.009
OpenAlex ID: W2153219831
cites work: The domination number of cubic Hamiltonian graphs
cites work: Domination in a graph with a 2‐factor
cites work: On domination in connected cubic graphs
cites work: Paths, Stars and the Number Three
cites work: On domination in 2-connected cubic graphs
cites work: Domination in graphs of minimum degree at least two and large girth
DOI: 10.1016/J.DISC.2007.12.009
description: scientific article; zbMATH DE number 5542434