The point-arboricity of planar graphsG ChartrandH V KronkThe point-arboricity ρ( G ) of a graph G is defined as the minimum number of subsets in a partition of the point set of G so that each subset induces an acyclic subgraph. Dually, the tuleity τ( G ) is the maximum number ...
The arboricity of a graph is the minimum number of forests required to cover all its edges. In this paper, we examine arboricity from a game-theoretic pers
Linear arboricity conjecture 1. Introduction A linear forest is a forest in which every connected component is a path. Given a graph G, we define its linear arboricity, denoted by la(G), to be the minimum number of edge-disjoint linear forests in G whose union is E(G). This notion was...
The bend-number b(G) of a graph G is the minimum k such that G may be represented as the edge intersection graph of a set of grid paths with at most k bends. We confirm a conjecture of Biedl and Stern showing that the maximum bend-number of outerplanar graphs is 2. Moreover we ...
1) the edge lin-ear arboricity of a graph 图的边线荫度 2) the vertice linear arboricity of a graph 图的点线荫度 3) Vertex Arboricity of Square Graphs 平方图的点荫度 4) The List Point Arboricity of Graphs 图的列表点荫度 例句>>
1) the vertice linear arboricity of a graph 图的点线荫度 2) Vertex Arboricity of Square Graphs 平方图的点荫度 3) The List Point Arboricity of Graphs 图的列表点荫度 例句>> 4) the edge lin-ear arboricity of a graph 图的边线荫度
The concept of acyclic coloring was introduced by Grnbaum [5] and is a generalization of point arboricity.A proper k-coloring of the vertices of a graph Gis said to be acyclic if G contains no two-colored cycle. The acyclic chromatic num... Michael,O.,Albertson,... - 《Glasgow Mathemat...
WI J. Mitchem, On the point arboricity of a graph and its complement, Cand. J. Math., XXIII, 2 (1971) 287-292.J. Mitchem.On the point-arboricity of a graph and its complement. Canad...
point‐arboricitygraph coloringcritical graphIn this paper, we study the critical point-arboricity graphs. We prove two lower bounds for the number of edges of k-critical point-arboricity graphs. A theorem of Kronk is extended by proving that the point-arboricity of a graph G embedded on a ...
V. Kronk, The point-arboricity of planar graphs, J. Lond. Math. Soc., 44 (1969), 612-616. http://dx.doi.org/10.1112/jlms/s1-44.1.612G. Chartrand and H.V. Kronk, The point arboricity of planar graphs. J. London Math. Soc. 44 (1969), 612-616....