Efficient Domination for Some Subclasses of $P_6$ -free Graphs in Polynomial Time
Authors:
- 5 August 2016
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 78-89
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Efficient Domination for Some Subclasses of $P_6$ -free Graphs in Polynomial TimeLecture Notes in Computer Science, 2016
- Weighted efficient domination in two subclasses of -free graphsDiscrete Applied Mathematics, 2016
- Independence and Efficient Domination on P6-free Graphs2015
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphsInformation Processing Letters, 2015
- New Polynomial Cases of the Weighted Efficient Domination Problem2013
- Hereditary Efficiently Dominatable GraphsJournal of Graph Theory, 2012
- Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs2012
- The strong perfect graph theoremAnnals of Mathematics, 2006
- Graph Classes: A Survey1999
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981