2 search results - page 1 / 1 » On Arithmetic Progressions Of Cycle Lengths In Graphs |
CPC
2000
15 years 2 days ago
2000
A recently posed question of H
131
Voted
FSTTCS
2010
Springer
14 years 10 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...