2 search results - page 1 / 1 » On Arithmetic Progressions Of Cycle Lengths In Graphs |
154
click to vote
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...