標(biāo)題: Titlebook: One-Factorizations; W. D. Wallis Book 1997 Springer Science+Business Media Dordrecht 1997 Matching.graph theory.graphs.mathematics.combina [打印本頁] 作者: decoction 時間: 2025-3-21 18:48
書目名稱One-Factorizations影響因子(影響力)
書目名稱One-Factorizations影響因子(影響力)學(xué)科排名
書目名稱One-Factorizations網(wǎng)絡(luò)公開度
書目名稱One-Factorizations網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱One-Factorizations被引頻次
書目名稱One-Factorizations被引頻次學(xué)科排名
書目名稱One-Factorizations年度引用
書目名稱One-Factorizations年度引用學(xué)科排名
書目名稱One-Factorizations讀者反饋
書目名稱One-Factorizations讀者反饋學(xué)科排名
作者: pulse-pressure 時間: 2025-3-21 23:50
Graphs without One-Factors, so the sum of the degrees of the . vertices is ., whence the number of edges joining the component to . must be at least . — .(. — 1). For fixed . and for integer . satisfying 1 ≤ . ≤ . this function has minimum value . (achieved at . 1 and .). So any odd component with . or fewer vertices is joined to . by . or more edges.作者: 疏忽 時間: 2025-3-22 04:26
Subfactorizations and Asymptotic Numbers of One-Factorizations, of . or has edge-set ?. If this occurs, order the .. so that . ? .., . ? .., ..., . ? .. are one-factors in ., while . ? .. has no edges for . > .. Then the first . factors . ? .. form a one-factorization of ., and this is called a . of. (or a .).作者: COLON 時間: 2025-3-22 07:00
Starters, that the .? 1 chords separate pairs of vertices which differ (modulo 2. ? 1) by different numbers, and that on rotation the one edge which represents distance . will generate all edges with distance ..作者: 無法破譯 時間: 2025-3-22 09:50 作者: RENAL 時間: 2025-3-22 14:41 作者: 助記 時間: 2025-3-22 20:52 作者: 文件夾 時間: 2025-3-22 22:28 作者: DEI 時間: 2025-3-23 04:49
W. D. Wallisigfaltigsten Krankheitsbildern führen k?nnen.Man kennt andererseits die Bedeutung einer unz?hlbaren Menge chemischer Substanzen für das Zustandekommen des prim?ren Kontaktekzems, das von allen Ekzemtypen als am besten erforscht gelten darf (.). Man wei? jedoch wenig über das ?u?erst komplexe Problem作者: Sad570 時間: 2025-3-23 05:56 作者: 纖細(xì) 時間: 2025-3-23 12:19
W. D. Wallis aus bei weitem die bedeutendste. ., ein Sammler des Londoner Hauses ., hatte die Wildart an den Kalksteinfelsen und in den Schluchten n?rdlich des Jangtse in West Hupe entdeckt und den Samen nach England geschickt. Dort wurde die Pflanze schon im n?chsten Jahr zum Blühen gebracht. Sie wurde zun?chs作者: EXALT 時間: 2025-3-23 14:35 作者: 傷心 時間: 2025-3-23 19:00 作者: Epithelium 時間: 2025-3-24 01:53
W. D. Wallista, die Cestoden zur Familie Hymenolepididae. 2. Es werden die Ergebnisse mit den Befunden aus anderen europ?ischen L?ndern verglichen. Für folgende Helminthen werden als neue Wirte angegeben: Für Prosthodendrium aelleni M yotis emarginatus und M yotis nattere1·i ; für Parabascus duboisi Rhinolophus作者: collagenase 時間: 2025-3-24 05:39 作者: laxative 時間: 2025-3-24 06:49 作者: 鐵砧 時間: 2025-3-24 12:14 作者: 售穴 時間: 2025-3-24 17:48 作者: Minuet 時間: 2025-3-24 19:43 作者: 生來 時間: 2025-3-25 01:20 作者: chassis 時間: 2025-3-25 05:46
Tournament Applications of One-Factorizations,an edge . representing a game between teams . and .. We shall refer to such a league — where two participants meet in each game — as a .. (The word “tournament” is also used for the directed graphs derived from this model by directing the edge from winner to loser, but we shall not consider the resu作者: 長處 時間: 2025-3-25 09:00
Graphs without One-Factors,he component is at most .. This means that the sum of the degrees of these . vertices in . — . is at most .(. — 1). But in . each vertex has degree ., so the sum of the degrees of the . vertices is ., whence the number of edges joining the component to . must be at least . — .(. — 1). For fixed . an作者: fixed-joint 時間: 2025-3-25 14:05
Edge-Colorings,to {1, 2, ..., .}, with the property that if . and . are edges with a common vertex then .(.)≠ .(.) is .-edge-colorable if there is a .-edgecoloring of .; the edge-chromatic number .′(.) of . is the smallest number . such that . is .-edge-colorable. .′(.) is also called the . of ..作者: exclusice 時間: 2025-3-25 17:12
One-Factorizations and Triple Systems, . from a .-set so that any element belongs to precisely . of the sets and any two elements commonly belong to λ of them. The .-sets are called .. It is easy to see that these parameters are not independent — in fact, .(. — 1) = λ(. — 1) and . = . — and that the constancy of . is implied by the cons作者: EWER 時間: 2025-3-26 00:02
Starters,center. This arrangement is shown in Figure 10.1, with the vertices labelled {∞,0, 1,... 2. ? 2}. The one-factor .. is shown in that Figure. .. is constructed by rotating .. through one-(2. ? 2)th part of a revolution, clockwise, and subsequent factors are obtained in the same way. It is easy to see作者: 使成整體 時間: 2025-3-26 02:28 作者: 不法行為 時間: 2025-3-26 07:06
Subfactorizations and Asymptotic Numbers of One-Factorizations,ces. It may be, however, that for every ., . ? .. consists either only of edges or only of vertices; in other words each . ? .. either is a one-factor of . or has edge-set ?. If this occurs, order the .. so that . ? .., . ? .., ..., . ? .. are one-factors in ., while . ? .. has no edges for . > .. T作者: 不遵守 時間: 2025-3-26 09:21
Maximal Sets of Factors,factor compatible with them. A one-factorization is trivially a maximal set; a maximal set of fewer than . one-factors in a regular graph of degree . will be called .. Theorem 8.3 essentially tells us that .. has no proper maximal set (see Theorem 18.13, below). It is natural to ask about the existe作者: etidronate 時間: 2025-3-26 12:50
Mathematics and Its Applicationshttp://image.papertrans.cn/o/image/701473.jpg作者: Decibel 時間: 2025-3-26 19:22
https://doi.org/10.1007/978-1-4757-2564-3Matching; graph theory; graphs; mathematics; combinatorics作者: Obsessed 時間: 2025-3-27 00:19 作者: 最小 時間: 2025-3-27 02:00
Walks, Paths and Cycles,. A . is a walk in which no edge is repeated. A . is a walk in which no vertex is repeated; the . of a path is its number of edges. A walk is . when the first and last vertices, .. and .., are equal. A . of length . is a closed simple walk of length ., . ≥ 3, in which the vertices .., .., ..., x. are all different.作者: 值得贊賞 時間: 2025-3-27 08:29 作者: harangue 時間: 2025-3-27 11:01 作者: macabre 時間: 2025-3-27 16:14 作者: 標(biāo)準(zhǔn) 時間: 2025-3-27 21:12 作者: OPINE 時間: 2025-3-28 00:36 作者: 剛開始 時間: 2025-3-28 04:34
Graphs,Any reader of this book will have some acquaintance with graph theory. However it seems advisable to have an introductory chapter, not only for completeness, but also because writers in this area differ on fundamental definitions: it is necessary to establish our version of the terminology.作者: farewell 時間: 2025-3-28 08:44
One-Factors and One-Factorizations,If . is any graph, then a . or . of . is a subgraph with vertex-set . (.). A . of . is a set of factors of . which are pairwise . no two have a common edge —and whose union is all of ..作者: 節(jié)省 時間: 2025-3-28 12:50
Orthogonal One-Factorizations,There are a number of applications of one-factorizations in the theory of combinatorial designs. In general this topic is too big to discuss here, but we shall explore a couple of examples. In this chapter we look at the applications concerning Latin squares; one-factorizations and block designs are discussed in Chapter 9.作者: 催眠藥 時間: 2025-3-28 14:38
A General Existence Theorem,If . is any subset of the vertex-set . (.) of a graph or multigraph ., we write . to denote the graph constructed by deleting from . all vertices in . and all edges touching then. One can discuss the components of .; they are either . (have an odd number of vertices) or .. Let Φ. (.) denote the number of odd components of ..作者: GLUE 時間: 2025-3-28 21:45 作者: 暗諷 時間: 2025-3-29 00:18 作者: Innocence 時間: 2025-3-29 04:38 作者: 間諜活動 時間: 2025-3-29 07:41 作者: libertine 時間: 2025-3-29 13:45
One-Factorizations of Multigraphs,The complete multigraph λ.. has . vertices and there are λ edges joining each pair of vertices. One-factors and one-factorizations of λ.. are defined in the obvious way; if . is odd there can be no one-factor, and when . is even, say . = 2., one can produce a one-factorization of λ.. by taking λ copies of each factor in a one-factorization of ...作者: 分開如此和諧 時間: 2025-3-29 17:27
The One-Factorization Conjecture,The following conjecture has been made independently by a number of mathematicians (including the author, who was certainly not the first):... a . 2.... a ..作者: 領(lǐng)帶 時間: 2025-3-29 21:50
W. D. Wallisen bestehen zwischen den ein- zelnen Fledermausarten gro?e Unterschiede in der Parasitenfauna, besonders im Befall durch Trematoden einerseits und Cestoden ande978-3-662-22850-0978-3-662-24784-6Series ISSN 0029-8816 作者: 防銹 時間: 2025-3-30 03:56 作者: Ossification 時間: 2025-3-30 05:17
W. D. Wallisnd so wurde das Posener Land, wenngleich es keine selbst?ndigen Leistungen hervorzubringen vermochte, doch von allen Wandlungen der Kunstgeschichte des Mittelalters und der Neuzeit berührt. Trotzdem hat die wissenschaftliche Forschung die Denkm?ler der Provinz Posen nur selten in ihren Studienkreis 作者: Exposure 時間: 2025-3-30 08:54 作者: Infant 時間: 2025-3-30 15:30
W. D. Wallisen an erster Stelle Staphylokokken. Dementsprechend ergaben die epicutanen Hauttests mit den aus den Ekzemherden isolierten Bakterien beim Patienten am h?ufigsten mit Staphylococcus aureus (haem.) (Bakterien und Bouillonkulturfiltrate) ekzemat?se Reaktionen. Alle anderen Bakterien treten dagegen wei作者: Ingratiate 時間: 2025-3-30 20:06
W. D. Wallisen an erster Stelle Staphylokokken. Dementsprechend ergaben die epicutanen Hauttests mit den aus den Ekzemherden isolierten Bakterien beim Patienten am h?ufigsten mit Staphylococcus aureus (haem.) (Bakterien und Bouillonkulturfiltrate) ekzemat?se Reaktionen. Alle anderen Bakterien treten dagegen wei作者: BLANK 時間: 2025-3-31 00:14 作者: wangle 時間: 2025-3-31 03:42 作者: LARK 時間: 2025-3-31 08:53 作者: 群居動物 時間: 2025-3-31 11:16 作者: pulmonary-edema 時間: 2025-3-31 15:56 作者: AV-node 時間: 2025-3-31 20:10
W. D. Wallisnen, je nachdem sie ohne ?u?ere Reize eintreten, oder erst solche sie ausl?sen. Die Grenze zwischen diesen beiden Begriffen ist künstlich, denn wenn wir z. B. die Anh?ufung von Wasserstoffionen im Blut als Reiz des Atemzentrums auffassen, so kann man dessen Funktion auch reflektorisch nennen.作者: certain 時間: 2025-3-31 22:47 作者: CHURL 時間: 2025-4-1 03:08 作者: 搖擺 時間: 2025-4-1 09:00
