On distance ‐dominating and ‐independent sets in sparse graphs

DOI10.1002/jgt.22426zbMath1418.05100arXiv1710.10010OpenAlexW2963296241MaRDI QIDQ5379844

Zdeněk Dvořák

Publication date: 14 June 2019

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingindependent setdominating set

Mathematics Subject Classification ID

Linear programming (90C05) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Improved bounds for weak coloring numbers ⋮ Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs ⋮ A Note of Independent Number and Domination Number of Qn,k,m-Graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness ⋮ Local planar domination revisited ⋮ Vertex cover at distance on \(H\)-free graphs

This page was built for publication: On distance ‐dominating and ‐independent sets in sparse graphs