Search
Now showing items 1-2 of 2
Contraction Blockers for Graphs with Forbidden Induced Paths
(Springer-Verlag Berlin, 2015)
We consider the following problem: can a certain graph parameter of some given graph be reduced by at least d for some integer d via at most k edge contractions for some given integer k? We examine three graph parameters: ...
Searching circulant graphs
(2011)
[Abstract Not Available]