Exploració per tema "kk-independence"
Ara es mostren els items 1-1 de 1
-
Partitions of graphs into small and large sets
(2013-09)
Article
Accés restringit per política de l'editorialLet GG be a graph on nn vertices. We call a subset AA of the vertex set V(G)V(G)kk-small if, for every vertex v∈Av∈A, deg(v)≤n−|A|+kdeg(v)≤n−|A|+k. A subset B⊆V(G)B⊆V(G) is called kk-large if, for every vertex u∈Bu∈B, ...