Improved upper bounds on the domination number of graphs with minimum degree at least five

DOI10.1007/s00373-015-1585-7zbMath1339.05280arXiv1410.4334WikidataQ59072382 ScholiaQ59072382MaRDI QIDQ292247

Sandi Klavžar, Csilla Bujtás

Publication date: 13 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.4334

zbMATH Keywords

greedy algorithm; minimum degree; domination number

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)