Linear Separation of Total Dominating Sets in Graphs

DOI10.1007/978-3-642-45043-3_15zbMath1400.05171OpenAlexW105082217MaRDI QIDQ2864299

Nina Chiarelli, Martin Milanič

Publication date: 6 December 2013

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45043-3_15

zbMATH Keywords

total domishold graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

On a class of graphs between threshold and total domishold graphs ⋮ Linear separation of connected dominating sets in graphs

This page was built for publication: Linear Separation of Total Dominating Sets in Graphs