𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The determination of the cycle length in high level synthesis

✍ Scribed by Ming-Hwa Sheu; Yuan-Long Jeang; Jhing-Fa Wang; Jau-Yien Lee

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
848 KB
Volume
16
Category
Article
ISSN
0167-9260

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the distribution of cycle lengths in
On the distribution of cycle lengths in graphs
✍ A. GyΓ‘rfΓ‘s; J. KomlΓ³s; E. SzemerΓ©di πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 843 KB

The set of different cycle lengths of a graph G is denoted by C(G). We study how the distribution of C(G) depends on the minimum degree of G. We prove two results indicating that C(G) is dense in some sense. These results lead to the solution of a conjecture of Erdos and Hajnal stating that for suit

On the length of longest dominating cycl
On the length of longest dominating cycles in graphs
✍ Hoa Vu Dinh πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 719 KB

Vu Dinh, H., On the length of longest dominating cycles in graphs, Discrete Mathematics 121 (1993) 21 l-222. ## A cycle C in an undirected and simple graph if G contains a dominating cycle. There exists l-tough graph in which no longest cycle is dominating. Moreover, the difference of the length