The k-Dominating Graph
- 17 March 2013
- journal article
- research article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (3) , 609-617
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- The canonical coloring graph of trees and cyclesArs Mathematica Contemporanea, 2012
- Gray code numbers for graphsArs Mathematica Contemporanea, 2011
- On the complexity of reconfiguration problemsTheoretical Computer Science, 2011
- γ-graphs of graphsDiscussiones Mathematicae Graph Theory, 2011
- Finding paths between 3-coloringsJournal of Graph Theory, 2010
- Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distancesTheoretical Computer Science, 2009
- Connectedness of the graph of vertex-colouringsDiscrete Mathematics, 2008
- Graph Theory2008
- Chordal graphs and upper irredundance, upper domination and independenceDiscrete Mathematics, 1990
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972