Weighted Efficient Domination for $P_6$ -Free and for $P_5$ -Free Graphs
- 28 September 2016
- book chapter
- Published by Springer Nature
- p. 38-49
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Weighted Efficient Domination for $P_6$ -Free and for $P_5$ -Free Graphs2016
- Efficient Domination for Some Subclasses of $P_6$ -free Graphs in Polynomial TimeLecture Notes in Computer Science, 2016
- Independence and Efficient Domination on P6-free Graphs2015
- Recognition of Unipolar and Generalised Split GraphsAlgorithms, 2015
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphsInformation Processing Letters, 2015
- Algorithms for unipolar and generalized split graphsDiscrete Applied Mathematics, 2014
- New Polynomial Cases of the Weighted Efficient Domination Problem2013
- Hereditary Efficiently Dominatable GraphsJournal of Graph Theory, 2012
- Perfect codes in graphsJournal of Combinatorial Theory, Series B, 1973