𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the maximal number of independent circuits in a graph

✍ Scribed by K. Corrádi; A. Hajnal

Publisher
Akadmiai Kiad
Year
1963
Tongue
English
Weight
776 KB
Volume
14
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of maximal independent sets i
The number of maximal independent sets in a connected graph
✍ Jerrold R. Griggs; Charles M. Grinstead; David R. Guichard 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 1021 KB

We determine the maximum on n vertices can have, and we a question of Wilf. number of maximal independent sets which a connected graph completely characterize the extremal graphs, thereby answering \* Partially supported by NSF grant number DIMS-8401281. t Partially supported by NSF grant number D S

Constraints on the number of maximal ind
Constraints on the number of maximal independent sets in graphs
✍ Jiuqiang Liu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 387 KB 👁 2 views

## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G__. Let __i(G)__ denote the number of maximal independent sets of __G__. Here, we prove two conjectures, suggested by P. Erdös, that the maximum number of m

The number of maximal independent sets i
The number of maximal independent sets in connected graphs
✍ Zoltán Füredi 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 2 views

Generalizing a theorem of Moon and Moser. we determine the maximum number of maximal independent sets in a connected graph on n vertices for n sufficiently large, e.g., n > 50. = I .32. . .). Example 1.2. Let b, = i(C,), where C,z denotes the circuit of length n. Then b, = 3, 6, = 2, b, = 5, and b,

On the number of hamiltonian cycles in a
On the number of hamiltonian cycles in a maximal planar graph
✍ S. L. Hakimi; E. F. Schmeichel; C. Thomassen 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB 👁 2 views

## Abstract We consider the problem of the minimum number of Hamiltonian cycles that could be present in a Hamiltonian maximal planar graph on __p__ vertices. In particular, we construct a __p__‐vertex maximal planar graph containing exactly four Hamiltonian cycles for every __p__ ≥ 12. We also pro