975 resultados para Hamilton, Henry---1796
Resumo:
http://www.archive.org/details/amodernpioneerin00grifuoft
Resumo:
http://www.archive.org/details/dixhuitanschezle00fararich
Resumo:
http://www.archive.org/details/theunionmissiony00spuruoft
Resumo:
http://www.archive.org/details/historyofchristi003076mbp
Resumo:
It is shown that every connected, locally connected graph with the maximum vertex degree Δ(G)=5 and the minimum vertex degree δ(G)3 is fully cycle extendable. For Δ(G)4, all connected, locally connected graphs, including infinite ones, are explicitly described. The Hamilton Cycle problem for locally connected graphs with Δ(G)7 is shown to be NP-complete