✦ LIBER ✦

Boolean planarity characterization of graphs

✍ Scribed by Liu Yanpei

Book ID: 110556420
Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 1988
Tongue: English
Weight: 669 KB
Volume: 4
Category: Article
ISSN: 1439-7617
DOI: 10.1007/bf02560635

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On boolean characterizations of planarit

On boolean characterizations of planarity and planar embeddings of graphs

✍ Yanpei Liu 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 391 KB

Boolean approach to planar embeddings of

Boolean approach to planar embeddings of a graph

✍ Liu Yanpei 📂 Article 📅 1989 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 922 KB

Planarity of joined graphs

✍ Sitthiwiratham, T.; Promsakon, C. 📂 Article 📅 2009 🏛 Informa UK (Taylor & Francis) 🌐 English ⚖ 204 KB

Characterizing planarity using theta gra

Characterizing planarity using theta graphs

✍ Archdeacon, Dan; S?r�n?, Josef 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB

A theta graph is a homeomorph of K 2,3 . In an embedded planar graph the local rotation at one degree-three vertex of a theta graph determines the local rotation at the other degree-three vertex. Using this observation, we give a characterization of planar graphs in terms of balance in an associated

A characterization of planar cubic graph

A characterization of planar cubic graphs

✍ Charles H.C Little 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 676 KB

An algebraic characterization of planar

An algebraic characterization of planar graphs

✍ Dan Archdeacon; C. Paul Bonnington; Charles H. C. Little 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 773 KB

## Abstract A cycle in a graph is a set of edges that covers each vertex an even number of times. A cocycle is a collection of edges that intersects each cycle in an even number of edges. A bicycle is a collection of edges that is both a cycle and a cocycle. The cycles, cocycles, and bicycles each