✦ LIBER ✦

On a graph property generalizing planarity and flatness

✍ Scribed by Hein van der Holst; Rudi Pendavingh

Book ID: 106167707
Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 574 KB
Volume: 29
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-009-2219-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On generating planar graphs

✍ David Barnette 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 699 KB

A 3-valent graph G 1s cyclically n-connected provided one must cut at least n edges in ori4r to separate any two circuits of 6. If G is cyclically n-connected but any separation of G by cutting n edges yields a component consisting of a simple circuit, then we say that G is ' strong& cyclicaZZy n-co

On a generalization of principal weak fl

On a generalization of principal weak flatness property

✍ Qiao, Husheng; Wei, Chongqing 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 466 KB

Properties of a planar cubic graph

✍ Shunichi Toida 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 506 KB

It is shown that a planar can always be to planar graph fewer vertices. It is shown if a planar cubic graph is edge-3colorable then the reduction of the number of its vertices is possible without changing colors of its edges.

A criterion for the planarity of a graph

✍ Jerome R. Breitenbach 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 146 KB 👁 1 views

In a recent paper, Carsten Thomassen [Carsten Thomassen, Planarity and duality of finite and infinite graphs. J. Combinatorial Theory Ser. B 29 (1980) 244-2711 has shown that a number of criteria for the planarity of a graph can be reduced to that of Kuratowski. Here we present another criterion whi

A short proof of Kuratowski's graph plan

A short proof of Kuratowski's graph planarity criterion

✍ Makarychev, Yury 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB 👁 2 views

We present a new short combinatorial proof of the sufficiency part of the well-known Kuratowski's graph planarity criterion. The main steps are to prove that for a minor minimal non-planar graph G and any edge xy: (1) G-x-y does not contain θ-subgraph; (2) G-x-y is homeomorphic to the circle; (3)

A note on planar graphs

✍ David P. Brown; Alan Budner 📂 Article 📅 1965 🏛 Elsevier Science 🌐 English ⚖ 612 KB

Some new properties of the distribution of elements and vertices with respect to the windows of a connected planar graph G are established. It is also shown that a window matrix of G has properties similar to the properties of an incidence matrix of a graph which is not necessarily planar. A method