Zobrazeno 1 - 10
of 654
pro vyhledávání: '"L. H., Clark"'
Publikováno v:
Science Progress in the Twentieth Century (1919-1933), 1929 Jan 01. 23(91), 532-533.
Externí odkaz:
https://www.jstor.org/stable/43429906
Publikováno v:
Journal of the Royal Society of Arts, 1928 Apr . 76(3935), 607-607.
Externí odkaz:
https://www.jstor.org/stable/41357968
Publikováno v:
The Journal of Education, 1902 Jun . 561 (1385), 32-32.
Externí odkaz:
https://www.jstor.org/stable/44055305
Publikováno v:
Science Progress (1933- ), 1951 Jul 01. 39(155), 556-557.
Externí odkaz:
https://www.jstor.org/stable/43414234
Autor:
Strauss, Dorothy
Publikováno v:
The Journal of Educational Sociology, 1960 Jan 01. 33(5), 243-244.
Externí odkaz:
https://www.jstor.org/stable/2264843
Publikováno v:
Discrete Mathematics. 150(1-3):31-48
A graph G is called Ck-saturated if G contains no cycles of length k but does contain such a cycle after the addition of any new edge. Bounds are obtained for the minimum number of edges in Ck-saturated graphs for all k ≠ 8 or 10 and n sufficiently
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c70021dc1fcb7038ad4fd87d4b16a28
Publikováno v:
Discrete Mathematics. 125:15-30
The subdivision threshold for a graph F is the maximum number of edges, ex(n; FS), a graph of order n can have without containing a subdivision of F as a subgraph. We consider two instances: 1. (i) F is the graph formed by a cycle C one vertex of whi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f6c8d1ebeca5537d630ae344f03f6ab1
https://doi.org/10.1016/0012-365x(94)90140-6
https://doi.org/10.1016/0012-365x(94)90140-6
Publikováno v:
China Oncology. Sep2024, Vol. 34 Issue 9, p807-813. 7p.
Autor:
Phadungsombat, Juthamas1 (AUTHOR) juthamas@biken.osaka-u.ac.jp, Nakayama, Emi E.1 (AUTHOR), Shioda, Tatsuo1 (AUTHOR) shioda@biken.osaka-u.ac.jp
Publikováno v:
Viruses (1999-4915). Jul2024, Vol. 16 Issue 7, p1046. 33p.
Publikováno v:
Graphs and Combinatorics. 8:225-231
Bollobas posed the problem of finding the least number of edges,f(n), in a maximally nonhamiltonian graph of ordern. Clark and Entringer showedf(n)=3n/2 for all evenn?36 andf(n)=(3n+1)/2 or (3n+3)/2 for all oddn?55. We showf(n)=(3n+1)/2 for all oddn?
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::135b7f07542ae715c809b1ee8d23ce62
https://doi.org/10.1007/bf02349959
https://doi.org/10.1007/bf02349959