✦ LIBER ✦

Resonance Graphs and a Binary Coding for the 1-Factors of Benzenoid Systems

✍ Scribed by Zhang, Heping; Lam, Peter Che Bor; Shiu, Wai Chee

Book ID: 118197698
Publisher: Society for Industrial and Applied Mathematics
Year: 2008
Tongue: English
Weight: 414 KB
Volume: 22
Category: Article
ISSN: 0895-4801
DOI: 10.1137/070699287

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Clar formulas of a benzenoid system

The Clar formulas of a benzenoid system and the resonance graph

✍ Khaled Salem; Sandi Klavžar; Aleksander Vesel; Petra Žigert 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 557 KB

ChemInform Abstract: Formula for Calcula

ChemInform Abstract: Formula for Calculating the Wiener Index of Catacondensed Benzenoid Graphs.

✍ A. A. DOBRYNIN 📂 Article 📅 2010 🏛 John Wiley and Sons ⚖ 24 KB 👁 2 views

Edge-chromatic critical graphs and the e

Edge-chromatic critical graphs and the existence of 1-factors

✍ S. A. Choudum 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 300 KB 👁 1 views

## Abstract We give examples of edge‐chromatic critical graphs __G__ of the following types: (i) of even order and having no 1‐factor, and (ii) of odd order and having a vertex __v__ of minimum degree such that __G__ − __v__ has no 1‐factor. The first disproves a conjecture of S. Fiorini and R. J.

Aromatic and Pseudoaromatic Non-benzenoi

Aromatic and Pseudoaromatic Non-benzenoid Systems. III. The Synthesis of Some Ten π-Electron Systems 1-3

✍ Allinger, Norman L.; Youngdale, Gilbert A. 📂 Article 📅 1962 🏛 American Chemical Society 🌐 English ⚖ 980 KB

Comment on “A unique formal system for b

Comment on “A unique formal system for binary decompositions of database relations, probability distributions, and graphs”

✍ F.M. Malvestuto; M. Studeny 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 113 KB

A degree condition for the existence of

A degree condition for the existence of regular factors inK1,n-free graphs

✍ Ota, Katsuhiro; Tokuda, Taro 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB 👁 2 views

A graph is called K1,.-free if it contains no K l , n as an induced subgraph. Let n ( r 3), r be integers (if r is odd, r 2 n -1). We prove that every Kl,,-free connected graph G with rlV(G)I even has an r-factor if its minimum degree is at least This degree condition is sharp.