New Polynomial Case for Efficient Domination in P 6-free Graphs

DOI10.1007/978-3-319-14974-5_8zbMath1432.68182arXiv1409.1676OpenAlexW2113377594MaRDI QIDQ5174951

T. Karthick

Publication date: 19 February 2015

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graph algorithmssquare graphperfect codeefficient dominationdomination in graphs\(P _{6}\)-free graphs

Mathematics Subject Classification ID

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

Related Items (4)

Structure of squares and efficient domination in graph classes ⋮ Weighted efficient domination in two subclasses of \(P_6\)-free graphs ⋮ Efficient domination for classes of \(P_6\)-free graphs ⋮ Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time

This page was built for publication: New Polynomial Case for Efficient Domination in P 6-free Graphs