An upper bound on the domination number of a graph.
From MaRDI portal
Publication:3812287
DOI10.7146/math.scand.a-12152zbMath0662.05056OpenAlexW2482459031MaRDI QIDQ3812287
Publication date: 1986
Published in: MATHEMATICA SCANDINAVICA (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/166989
Related Items (2)
Learning bounds via sample width for classifiers on finite metric spaces ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication: An upper bound on the domination number of a graph.