✦ LIBER ✦

A Note on Planar Graphs and Circle Orders

✍ Scribed by Scheinerman, Edward R.

Book ID: 118197518
Publisher: Society for Industrial and Applied Mathematics
Year: 1991
Tongue: English
Weight: 350 KB
Volume: 4
Category: Article
ISSN: 0895-4801
DOI: 10.1137/0404040

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on graphs and sphere orders

✍ Edward R. Scheinerman 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

## Abstract A partially ordered set __P__ is called a __k‐sphere order__ if one can assign to each element a ∈ __P__ a ball __B__~__a__~ in __R^k^__ so that __a__ < __b__ iff __B__~__a__~ ⊂ __B__~__b__~. To a graph __G__ = (__V,E__) associate a poset __P__(__G__) whose elements are the vertices and

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

A note on 1-planar graphs

✍ Ackerman, Eyal 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 303 KB

A Note on l1-rigid Planar Graphs

✍ M. Deza; J. Tůma 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 198 KB

A characterization of planar graphs by t

A characterization of planar graphs by trémaux orders

✍ H. de Fraysseix; P. Rosenstiehl 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 364 KB

A note on list improper coloring planar

A note on list improper coloring planar graphs

✍ Ko-Wei Lih; Zengmin Song; Weifan Wang; Kemin Zhang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 267 KB

A graph G is called (k, d)\*-choosable if, for every list assignment L satisfying [L(v)l = k for all v E V(G), there is an L-coloring of G such that each vertex of G has at most d neighbors colored with the same color as itself. In this note, we prove that every planar graph without 4-cycles and /-c