The vertex arboricity va (G) of G is the smallest integer k which the acyclic partition of V (G)
make the vertex set V (G) be partitioned into k subsets which each subset induces an acyclic …

Let f be a nonnegative integer valued function on the vertex set of a graph. A graph is strictly
f-degenerate if each nonempty subgraph Γ has a vertex v such that deg Γ (v)< f (v). In this …

The vertex arboricity va (G) of a graph G is the minimum number of colors the vertices can be
colored so that each color class induces a forest. It was known that va (G) ≤ 3 va (G)≤ 3 for …

Bernshteyn and Lee defined a new notion, weak degeneracy, which is slightly weaker than
the ordinary degeneracy. It is proved that strictly $ f $-degenerate transversal is a common …

The vertex-arboricity a (G) of a graph G is the minimum number of colors required to color
the vertices of G such that no cycle is monochromatic. The list vertex-arboricity al (G) is the …

The vertex arboricity $\rho (G) $ of a graph $ G $ is the minimum number of subsets into
which the vertex set $ V (G) $ can be partitioned so that each subset induces an acyclic …

The vertex-arboricity va (G) of a graph G is defined to be the minimum number of colors
needed to color the vertices of G such that no cycle is monochromatic. The list vertex …

Let $ f $ be a nonnegative integer valued function on the vertex-set of a graph. A graph is {\bf
strictly $ f $-degenerate} if each nonempty subgraph $\Gamma $ has a vertex $ v $ such that …

在社团网络的研究中, 社团结构划分一直是一个有价值的研究课题. 出于安全考虑,
对一个新的社团结构划分问题进行研究, 它可以在图论中转化为最小化问题. 图G …

The vertex arboricity a (G) of a graph G is the minimum number of colors required to color
the vertices of G such that no cycle is monochromatic. The list vertex arboricity al (G) is the …