• Citer

Neighborhood Complexity of Planar Graphs

par Joret, Gwenaël ;Rambaud, Clément
Référence Combinatorica, 44, page (1115-1148)
Publication Publié, 2024-07-01

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

Reidl et al. (Eur J Comb 75:152–168, 2019) characterized graph classes of bounded expansion as follows: A class C closed under subgraphs has bounded expansion if and only if there exists a function f:N→N such that for every graph G∈C, every nonempty subset A of vertices in G and every nonnegative integer r, the number of distinct intersections between A and a ball of radius r in G is at most f(r)