Constant-factor approximation of the domination number in sparse graphs

DOI10.1016/j.ejc.2012.12.004zbMath1260.05111arXiv1110.5190MaRDI QIDQ1943391

Zdeněk Dvořák

Publication date: 19 March 2013

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

linear-time constant-factor algorithm; proper classes closed on topological minors; proper minor-closed graph classes

Mathematics Subject Classification ID

05C85: Graph algorithms (graph-theoretic aspects)

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

05C42: Density (toughness, etc.)