✦ LIBER ✦

A conjecture on benzenoid graphs

✍ Scribed by J. Cioslowski

Publisher: Springer
Year: 1991
Tongue: English
Weight: 26 KB
Volume: 6
Category: Article
ISSN: 0259-9791
DOI: 10.1007/bf01192577

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On isospectral benzenoid graphs

✍ D. Babić; I. Gutman 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 978 KB

On a harmonious graph conjecture

✍ Eugene Levine 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 125 KB

Let K~ ) be the umon of two complete graphs on n vertices which have preosely one vertex in common. Graham and Sloane have shown that K~ ~ is not harmomous for n od:~, /(~,~ is harmonious, and K~62~ is not harmonious. They also conjecture that K~' t,, not h,~rmomous except for n = 4. Here, it Is sho

A min-max result on catacondensed benzen

A min-max result on catacondensed benzenoid graphs

✍ S. Klavžar; P. Žigert 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 295 KB

The resonance graph of a benzenoid graph G has the 1-factors of G as vertices, two 1-factors being adjacent if their symmetric difference forms the edge set of a hexagon of G. It is proved that the smallest number of elementary cuts that cover a catacondensed bensenoid graph equals the dimension of

A conjecture on triangles of graphs

✍ Zsolt Tuza 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 563 KB

On a multiplicative graph function conje

On a multiplicative graph function conjecture

✍ Lih-Hsing Hsu 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 802 KB

For any graph H, the function h,. defined by setting h,(G) equal to the number of homomorphisms from G into H, is a multiplicative increasing function. L.ov&sz [2] has asked whether ail nonzero multiplicative increasing functions are generated by functions of this type. We show that this is not the

On the critical graph conjecture

✍ Hian Poh Yap 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 222 KB

## Abstract Gol'dberg has recently constructed an infinite family of 3‐critical graphs of even order. We now prove that if there exists a __p__(≥4)‐critical graph __K__ of odd order such that __K__ has a vertex __u__ of valency 2 and another vertex __v__ ≠ __u__ of valency ≤(__p__ + 2)/2, then ther