Weighted Efficient Domination for $$P_6$$ -Free and for $$P_5$$ -Free Graphs

DOI10.1007/978-3-662-53536-3_4zbMath1417.05151OpenAlexW2524560845MaRDI QIDQ3181045

Raffaele Mosca, Andreas Brandstädt

Publication date: 22 December 2016

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-662-53536-3_4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)

Related Items (2)

Efficient absorbants in generalized de Bruijn digraphs ⋮ On efficient domination for some classes of \(H\)-free chordal graphs

Cites Work

• Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
• Algorithms for unipolar and generalized split graphs
• Perfect codes in graphs
• Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time
• New Polynomial Cases of the Weighted Efficient Domination Problem
• Weighted Efficient Domination for $P_5$-Free and $P_6$-Free Graphs
• Independence and Efficient Domination on P₆-free Graphs
• Hereditary Efficiently Dominatable Graphs
• Unnamed Item

This page was built for publication: Weighted Efficient Domination for $$P_6$$ -Free and for $$P_5$$ -Free Graphs