Titlebook: Combinatorial Mathematics VIII; Proceedings of the E Kevin L. McAvaney Conference proceedings 1981 Springer-Verlag Berlin Heidelberg 1981 L

incoherent

書目名稱Combinatorial Mathematics VIII影響因子(影響力)




書目名稱Combinatorial Mathematics VIII影響因子(影響力)學(xué)科排名




書目名稱Combinatorial Mathematics VIII網(wǎng)絡(luò)公開度




書目名稱Combinatorial Mathematics VIII網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Combinatorial Mathematics VIII被引頻次




書目名稱Combinatorial Mathematics VIII被引頻次學(xué)科排名




書目名稱Combinatorial Mathematics VIII年度引用




書目名稱Combinatorial Mathematics VIII年度引用學(xué)科排名




書目名稱Combinatorial Mathematics VIII讀者反饋




書目名稱Combinatorial Mathematics VIII讀者反饋學(xué)科排名

BET

Further results on coverin integers of the form 1+k2N by primes,

Confound

Simple and multigraphic realizations of degree sequences,

婚姻生活

HEED

SPURN

SPURN

Connected subgraphs of the graph of multigraphic realisations of a degree sequence,t one edge of multiplicity .. A new proof is given that the graph ., of all .-graphic realisations of a degree sequence, ., is connected. This is done by taking any two vertices of ., say . and ., and finding a path between them which preserves any previously chosen edge of multiplicity . that occur

meritorious

A construction for a family of sets and its application to matroids,n applied to . then gives .. For each subset . of ., . for exactly one pair of .∈. and corresponding .∈.. When the family . is the basis collection of a matroid on . can be described simply in terms of the matroid structure. A polynomial is defined which, in this latter case, is the Tutte polynomial

收集

Regularity and optimality for trees,for a given number of leaves is called optimal. Bounds for the cost of an optimal tree are proved, and these bounds are used to restrict the possible outdegrees in optimal trees. Finally, a method for proving regularity in optimal trees is presented.

Lipoprotein(A)