2 search results - page 1 / 1 » Nowhere dense graph classes, stability, and the independence... |
71
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
JSYML
2010
14 years 5 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...