Alpha-Cells
发表于 2025-3-28 16:10:01
Combinatorial problems on series-parallel graphs,These include (i) the decision problem, and (ii) the minimum edge (vertex) deletion problem both with respect to a property characterized by a finite number of forbidden graphs, and (iii) the generalized matching problem.
极为愤怒
发表于 2025-3-28 19:45:07
http://reply.papertrans.cn/39/3880/387952/387952_42.png
举止粗野的人
发表于 2025-3-29 00:20:18
"Dualities" in graph theory and in the related fields viewed from the metatheoretical standpoint,alities concentrate in the "dual graph", wherefrom confusion is sometimes given rise to. The importance is illustrated by "new" theorems and concepts which are derived by understanding correctly the difference of the concepts.
condescend
发表于 2025-3-29 05:46:39
On central trees of a graph,s 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.
不可比拟
发表于 2025-3-29 08:18:52
Characterization of polyhex graphs as applied to chemistry,s for characterizing the polyhex graphs are described and discussed, including the topological index, characteristic polynomial, sextet polvnomial, etc. Enumeration of the number of the maximum matching (or Kekulé patterns) is also discussed.
Diaphragm
发表于 2025-3-29 13:21:45
Some common properties for regularizable graphs, edge-critical graphs and b-graphs,
新娘
发表于 2025-3-29 17:17:34
Celestino Pio Lombardi,Rocco Bellantoneided into unidirectional blocks. However, it is possible to divide a system into almost unidirectional blocks B. B. ... B. ... B. such that the existence of failure in B. will interfare only slightly to the performance of preceding blocks B. B. ... B..
gout109
发表于 2025-3-29 23:43:36
http://reply.papertrans.cn/39/3880/387952/387952_48.png
凹槽
发表于 2025-3-30 01:46:32
A status on the linear arboricity,icity is the . of a graph, which is defined as the minimum number of forests whose union is G. Nash-Williams determined the arboricity of any graph, however only few results on the linear arboricity are known. We shall present these discoveries and an open problem on this new invariant.
BROTH
发表于 2025-3-30 07:32:29
http://reply.papertrans.cn/39/3880/387952/387952_50.png