Titlebook: ;

明显

书目名称Graphs and Combinatorics影响因子(影响力)




书目名称Graphs and Combinatorics影响因子(影响力)学科排名




书目名称Graphs and Combinatorics网络公开度




书目名称Graphs and Combinatorics网络公开度学科排名




书目名称Graphs and Combinatorics被引频次




书目名称Graphs and Combinatorics被引频次学科排名




书目名称Graphs and Combinatorics年度引用




书目名称Graphs and Combinatorics年度引用学科排名




书目名称Graphs and Combinatorics读者反馈




书目名称Graphs and Combinatorics读者反馈学科排名

犬儒主义者

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

护航舰

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

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.

纠缠

纠缠

anachronistic

集合

承认