𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Odd Cycle Transversals and Independent Sets in Fullerene Graphs

✍ Scribed by Faria, Luerbio; Klein, Sulamita; Stehlík, Matěj

Book ID
118197186
Publisher
Society for Industrial and Applied Mathematics
Year
2012
Tongue
English
Weight
298 KB
Volume
26
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Independent Dominating Sets and a Second
Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs
✍ Carsten Thomassen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 241 KB

In 1975, John Sheehan conjectured that every Hamiltonian 4-regular graph has a second Hamiltonian cycle. Combined with earlier results this would imply that every Hamiltonian r-regular graph (r 3) has a second Hamiltonian cycle. We shall verify this for r 300.

Maximal independent sets in graphs with
Maximal independent sets in graphs with at most one cycle
✍ Min-Jen Jou; Gerard J. Chang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 356 KB

In this paper, we determine the largest number of maximal independent sets among all connected graphs of order n, which contain at most one cycle. We also characterize those extremal graphs achieving this maximum value. As a consequence, the corresponding results for graphs with at most one cycle bu

Maximal independent sets in bipartite gr
Maximal independent sets in bipartite graphs
✍ Jiuqiang Liu 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 458 KB 👁 1 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.__ In this paper, we determine the maximum number of maximal independent sets among all bipartite graphs of order __n__ and the extremal graphs as well as