Titlebook: ;

Mangle

ULCER

https://doi.org/10.1007/978-3-030-57219-8hm tests the subgraph of the given graph G for planarity and if the subgraph fails the test, it deletes a minimum number of edges necessary for planarization. The subgraph has one vertex at the beginning, and the number of its vertices is increased one by one until all the vertices of G are included

maladorit

过于平凡

https://doi.org/10.1007/978-94-011-2759-2s of central trees have been clarified. In this paper, in connection with the critical sets of the edge set of a graph, some new theorems on central trees of the graph are presented. Also, a few examples are included to illustrate the applications of these theorems.

无能力之人

aerial

kindred

Surgeon

A status on the linear arboricity,riant first arose in a study [10] of information retrieval in file systems. A quite similar covering invariant which is well known to the linear arboricity is the . of a graph, which is defined as the minimum number of forests whose union is G. Nash-Williams [11] determined the arboricity of any gra

enfeeble

On centrality functions of a graph,he vertices classified according to the distance from a given vertex. Some fundamental properties of the centrality functions and the set of central vertices are summarized. Inserting an edge between a center and a vertex, the stability of the set of central vertices are investigated..For a weakly c

adduction

Canonical decompositions of symmetric submodular systems,. We examine the structures of symmetric submodular systems and provide a decomposition theory of symmetric submodular systems. The theory is a generalization of the decomposition theory of 2-connected graphs developed by W. T. Tutte.