✦ LIBER ✦

On cleaving a planar graph

✍ Scribed by Shankar M. Venkatesan

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 423 KB
Volume: 81
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90183-i

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On the depth of a planar graph

✍ Vinay G. Kane; Sanat K. Basu 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 525 KB

On-line Planar Graph Embedding

✍ Roberto Tamassia 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 504 KB

We present a dynamic data structure for the incremental construction of a planar embedding of a planar graph. The data structure supports the following Ž . operations: i testing if a new edge can be added to the embedding without Ž . introducing crossing; and ii adding vertices and edges. The time c

On planar hypohamiltonian graphs

✍ Gábor Wiener; Makoto Araya 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

We present a planar hypohamiltonian graph on 42 vertices and (as a corollary) a planar hypotraceable graph on 162 vertices, improving the bounds of Zamfirescu and Zamfirescu and show some other consequences. We also settle the open problem whether there exists a positive integer N, such that for eve

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

Quickly Excluding a Planar Graph

✍ N. Robertson; P. Seymour; R. Thomas 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 1014 KB