๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fertility cycles: A note on onset and periodicity

โœ Scribed by Brian J. L. Berry

Publisher
Springer-Verlag
Year
1999
Tongue
English
Weight
226 KB
Volume
21
Category
Article
ISSN
1573-7810

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A note on distance-dominating cycles
A note on distance-dominating cycles
โœ P. Fraisse ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 396 KB

Nous prouvons une conjecture due & Bondy et Fan. Un cycle C d'un graphe G est dit m-dominant si tout sommet de V(G -C) est a distance au plus m de C. Notre r&t&at est: si G est k-connexe, et si G n'a pas de cycle m-dominant, alors il existe un stable de cardinal k + 1, dont les sommets sont deux 3 d

A note on odd/even cycles
A note on odd/even cycles
โœ Anna Lubiw ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 397 KB
A note on short cycles in diagraphs
A note on short cycles in diagraphs
โœ C.T Hoร ng; B Reed ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 297 KB

if G is a directed graph with n vertices and minimal outdegree k, then G contains a directed cycle of length at most In~k]. This conjecture is known to be true for k ~< 3. In this paper, we present a proof of the conjecture for the cases k = 4 and k = 5. We also present a new conjecture which implie

A note on graphs whose neighborhoods are
A note on graphs whose neighborhoods aren-cycles
โœ Bruce L. Chilton; Ronald Gould; Albert D. Polimeni ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Springer ๐ŸŒ English โš– 220 KB

AnSTRACr. Let G be a graph, and let v be a vertex of G. We denote by N(v) the set of vertices of G which are adjacent to v, and by (N(v)) the subgraph of G induced by N(v). We call <N(v)) the neighborhood of v. In a paper of 1968, Agakishieva has, as one of her main theorems, the statement: "Graphs