incoherent
发表于 2025-3-21 19:55:22
书目名称Combinatorial Mathematics VIII影响因子(影响力)<br> http://impactfactor.cn/2024/if/?ISSN=BK0229933<br><br> <br><br>书目名称Combinatorial Mathematics VIII影响因子(影响力)学科排名<br> http://impactfactor.cn/2024/ifr/?ISSN=BK0229933<br><br> <br><br>书目名称Combinatorial Mathematics VIII网络公开度<br> http://impactfactor.cn/2024/at/?ISSN=BK0229933<br><br> <br><br>书目名称Combinatorial Mathematics VIII网络公开度学科排名<br> http://impactfactor.cn/2024/atr/?ISSN=BK0229933<br><br> <br><br>书目名称Combinatorial Mathematics VIII被引频次<br> http://impactfactor.cn/2024/tc/?ISSN=BK0229933<br><br> <br><br>书目名称Combinatorial Mathematics VIII被引频次学科排名<br> http://impactfactor.cn/2024/tcr/?ISSN=BK0229933<br><br> <br><br>书目名称Combinatorial Mathematics VIII年度引用<br> http://impactfactor.cn/2024/ii/?ISSN=BK0229933<br><br> <br><br>书目名称Combinatorial Mathematics VIII年度引用学科排名<br> http://impactfactor.cn/2024/iir/?ISSN=BK0229933<br><br> <br><br>书目名称Combinatorial Mathematics VIII读者反馈<br> http://impactfactor.cn/2024/5y/?ISSN=BK0229933<br><br> <br><br>书目名称Combinatorial Mathematics VIII读者反馈学科排名<br> http://impactfactor.cn/2024/5yr/?ISSN=BK0229933<br><br> <br><br>
BET
发表于 2025-3-21 22:50:23
Further results on coverin integers of the form 1+k2N by primes,
Confound
发表于 2025-3-22 00:24:42
Simple and multigraphic realizations of degree sequences,
婚姻生活
发表于 2025-3-22 04:46:14
http://reply.papertrans.cn/23/2300/229933/229933_4.png
HEED
发表于 2025-3-22 12:13:45
http://reply.papertrans.cn/23/2300/229933/229933_5.png
SPURN
发表于 2025-3-22 16:24:20
http://reply.papertrans.cn/23/2300/229933/229933_6.png
SPURN
发表于 2025-3-22 17:47:02
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
发表于 2025-3-22 22:42:50
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
收集
发表于 2025-3-23 04:25:06
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)
发表于 2025-3-23 08:48:47
http://reply.papertrans.cn/23/2300/229933/229933_10.png