✦ LIBER ✦

A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs

✍ Scribed by Sandi Klavžar; Khaled Salem

Book ID: 113564768
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 190 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.12.030

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On long cycles in a 2-connected bipartit

On long cycles in a 2-connected bipartite graph

✍ Hong Wang 📂 Article 📅 1996 🏛 Springer Japan 🌐 English ⚖ 822 KB

A comparison between 1-factor count and

A comparison between 1-factor count and resonant pattern count in plane non-bipartite graphs

✍ Heping Zhang; Jinghua He 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 110 KB

A characterization of bipartite graphs a

A characterization of bipartite graphs associated with BIB-designs with λ = 1

✍ Raffaele Scapellato 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 297 KB

The existence of a 2-factor in K1, n-fre

The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity

✍ R. E. L. Aldred; Yoshimi Egawa; Jun Fujisawa; Katsuhiro Ota; Akira Saito 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n ≥ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.

Upon the removal of the edges of a 1-fac

Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph

✍ Philip Sinclair 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 206 KB