✦ LIBER ✦

Optimal representation of cycles in arithmetic graphs

✍ Scribed by Yu. I. Nezhentsev

Publisher: Springer US
Year: 1991
Tongue: English
Weight: 489 KB
Volume: 27
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01068643

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Existence and representation of natural

Existence and representation of natural arithmetic graphs

✍ YU.G. Grigor'yan 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 337 KB

Optimal Polygonal Representation of Plan

Optimal Polygonal Representation of Planar Graphs

✍ C. A. Duncan; E. R. Gansner; Y. F. Hu; M. Kaufmann; S. G. Kobourov 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 724 KB

The construction of optimal Hamiltonian

The construction of optimal Hamiltonian cycles in multivertex graphs

✍ Zh. N. Zaitseva; M. E. Shtein 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 294 KB

An optimal algorithm for finding dominat

An optimal algorithm for finding dominating cycles in circular-arc graphs

✍ J.Mark Keil; Doug Schaefer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 972 KB

An optimal algorithm for cycle breaking

An optimal algorithm for cycle breaking in directed graphs

✍ Tatiana Orenstein; Zvi Kohavi; Irith Pomeranz 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 831 KB

Lengths of cycles in halin graphs

✍ J. A. Bondy; L. Lovász 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 436 KB 👁 1 views

A Halin graph is a plane graph H = T U C, where T is a plane tree with no vertex of degree t w o and at least one vertex of degree three or more, and C is a cycle connecting the endvertices of T in the cyclic order determined by the embedding of T We prove that such a graph on n vertices contains cy