明显 发表于 2025-3-21 17:22:29

书目名称Graphs and Combinatorics影响因子(影响力)<br>        http://impactfactor.cn/if/?ISSN=BK0388159<br><br>        <br><br>书目名称Graphs and Combinatorics影响因子(影响力)学科排名<br>        http://impactfactor.cn/ifr/?ISSN=BK0388159<br><br>        <br><br>书目名称Graphs and Combinatorics网络公开度<br>        http://impactfactor.cn/at/?ISSN=BK0388159<br><br>        <br><br>书目名称Graphs and Combinatorics网络公开度学科排名<br>        http://impactfactor.cn/atr/?ISSN=BK0388159<br><br>        <br><br>书目名称Graphs and Combinatorics被引频次<br>        http://impactfactor.cn/tc/?ISSN=BK0388159<br><br>        <br><br>书目名称Graphs and Combinatorics被引频次学科排名<br>        http://impactfactor.cn/tcr/?ISSN=BK0388159<br><br>        <br><br>书目名称Graphs and Combinatorics年度引用<br>        http://impactfactor.cn/ii/?ISSN=BK0388159<br><br>        <br><br>书目名称Graphs and Combinatorics年度引用学科排名<br>        http://impactfactor.cn/iir/?ISSN=BK0388159<br><br>        <br><br>书目名称Graphs and Combinatorics读者反馈<br>        http://impactfactor.cn/5y/?ISSN=BK0388159<br><br>        <br><br>书目名称Graphs and Combinatorics读者反馈学科排名<br>        http://impactfactor.cn/5yr/?ISSN=BK0388159<br><br>        <br><br>

犬儒主义者 发表于 2025-3-21 22:27:39

On covering the points of a graph with point disjoint paths,termining ζ in the case of a tree, and it is shown that this tree algorithm can be generalized to yield ζ for any connected graph. Degree conditions are also derived which yield simple upper bounds for ζ.

PALSY 发表于 2025-3-22 04:20:27

http://reply.papertrans.cn/39/3882/388159/388159_3.png

护航舰 发表于 2025-3-22 04:59:03

A class of starter induced 1-factorizations,inct 1-factors is a Hamiltonian circuit. This problem, generalized to K., has arisen in several contexts and the above result strengthens the conjecture of various authors that such 1-factorizations exist on all K.. The first unsettled case is now K..

Laconic 发表于 2025-3-22 12:36:44

https://doi.org/10.1007/978-3-476-02798-6ated and partial results obtained to date are indicated. We conclude with a summary of structures other than trees which have been reconstructed, and some remarks on the reconstruction of countably infinite graphs.

纠缠 发表于 2025-3-22 16:08:56

http://reply.papertrans.cn/39/3882/388159/388159_6.png

纠缠 发表于 2025-3-22 18:06:09

http://reply.papertrans.cn/39/3882/388159/388159_7.png

anachronistic 发表于 2025-3-22 23:08:14

http://reply.papertrans.cn/39/3882/388159/388159_8.png

集合 发表于 2025-3-23 02:52:39

http://reply.papertrans.cn/39/3882/388159/388159_9.png

承认 发表于 2025-3-23 06:28:50

http://reply.papertrans.cn/39/3882/388159/388159_10.png
页: [1] 2 3 4 5 6 7
查看完整版本: Titlebook: ;