Báo cáo toán học: " How to find overfull subgraphs in graphs with large maximum degree, II" ppsx

... 249–251. [8] T. Niessen. How to find overfull subgraphs in graphs with large maximum degree. Discrete Applied Math. 51 (1994), 117–125. [9] L. Perkovic and B. Reed. Edge colouring regular graphs of high ... Thereby, we find all induced ∆ -overfull subgraphs of G with more than |V (ker(G))|−∆(G) vertices. The second phase consists of finding a certain edge cut F o...

Ngày tải lên: 07/08/2014, 06:22

... we suggest to use an instantaneous sink strength of each meristem, related to its size. After having justified this approach by experimental data, we show how this sink strength indicator can vary ... sub- tracting the total maintenance respiration cost from the total pool of carbohydrates. Regarding growth, the sink strength is a key point in those source-sink models. It determines l...

Ngày tải lên: 08/08/2014, 14:22

... node to leaf x we branch off additional leaves j for each line L j that intersects the line L i in its x-halfray. This branching takes place in the order in which the lines L j intersect L j . In ... two configurations shown in Figure 4. the electronic journal of combinatorics 16(2) (2009), #R6 14 in R n+1 induce a polytopal subdivision of P . Polytopal subdivisions arising in t...

Ngày tải lên: 08/08/2014, 01:20

... anyone interested in developing the prototype into a robust system (for example, to be integrated into a WP system) is invited to contact the author! ACKNOWLEDGEMENTS This paper was originally ... with no indication of where' within this text the actual errors lie. One way to deal with this problem is to increase the size and power of the parser and underlying gramma...

Ngày tải lên: 24/03/2014, 05:21

... h 1" alt =""

Ngày tải lên: 05/08/2014, 10:20

... vertices is defined to be a total k-dominating set of G if every vertex in V is within distance k from some vertex of D other than itself. The minimum cardinality among all total k-dominating sets of ... components can be joined to a connected k-dominating set D by adding at most (|I 1 | + |I 2 |/2 − 1)2k vertices to D  . All in all we have shown that there exists a connected k-do...

Ngày tải lên: 07/08/2014, 15:22

... of G is dominating, if every vertex in V \ D has a neighbour in D. The minimum cardinality of a dominating set is the domination number γ(G) of G. A set of vertices I ⊆ V of G is independent, ... cardinality of the resulting dominating set equals  u∈V  p u +  v∈N G [u] (1 − p v )  . This is in fact a multilinear function, i.e. fixing all but one variable results in a linear functio...

Ngày tải lên: 08/08/2014, 12:22

... of minor mental disorders in suicidal behaviour was also demonstrated by two recent studies showing that a pre- existing anxiety disorder in combination with major mood disorder was associated with ... depression [69-74]. In most cases these minor mental disorders seem to be self-restricting in the general population and in the large number of patients treated in primary c...

Ngày tải lên: 08/08/2014, 23:20

... participating Table 1. Amino acid frequencies (%) in a-amylase linkers, in a set of globular proteins, in the Swiss-Prot databank and in intrinsically unstructured proteins. Amino acid Linkers a Globular proteins b Swiss-Prot c Intrinsically unstructured proteins b Ala ... repeats consisting of proline, glycine, asparagine, serine, and ⁄ or threonine rich oligopeptides in proteins....

Ngày tải lên: 14/02/2014, 18:20

Ngày tải lên: 21/02/2014, 20:20