Titlebook: ;

明顯

書(shū)目名稱Graphs and Combinatorics影響因子(影響力)




書(shū)目名稱Graphs and Combinatorics影響因子(影響力)學(xué)科排名




書(shū)目名稱Graphs and Combinatorics網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Graphs and Combinatorics網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Graphs and Combinatorics被引頻次




書(shū)目名稱Graphs and Combinatorics被引頻次學(xué)科排名




書(shū)目名稱Graphs and Combinatorics年度引用




書(shū)目名稱Graphs and Combinatorics年度引用學(xué)科排名




書(shū)目名稱Graphs and Combinatorics讀者反饋




書(shū)目名稱Graphs and Combinatorics讀者反饋學(xué)科排名

犬儒主義者

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

護(hù)航艦

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

集合

承認(rèn)