Near-domination in graphs

DOI10.1016/j.jcta.2019.02.009zbMath1414.05231arXiv1710.06680OpenAlexW2962784526WikidataQ128298062 ScholiaQ128298062MaRDI QIDQ2424917

P. D. Seymour, Alexander D. Scott, Bruce A. Reed

Publication date: 25 June 2019

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

dominationthreshold graphedit distance

Mathematics Subject Classification ID

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

Cites Work

• Ramsey-type theorems
• The early evolution of the \(H\)-free process
• Excluding a Substar and an Antisubstar
• Ramsey-type theorems with forbidden subgraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Near-domination in graphs