✦ LIBER ✦

Rectangular duals of planar graphs

✍ Scribed by Krzysztof Koźmiński; Edwin Kinnen

Publisher: John Wiley and Sons
Year: 1985
Tongue: English
Weight: 645 KB
Volume: 15
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230150202

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time algorithm to check for the

A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph

✍ Jayaram Bhasker; Sartaj Sahni 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 488 KB

Projective-planar graphs with even duals

✍ Seiya Negami 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 472 KB

## Abstract Let __G__ be a connected graph which is projective‐planar but is not planar. It will be shown that __G__ can be embedded in the projective plane so that it has only even faces if and only if either __G__ is bipartite or its canonical bipartite covering is planar and that such an embeddi

Rectangular and visibility representatio

Rectangular and visibility representations of infinite planar graphs

✍ Carsten Thomassen 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 75 KB

## Abstract We provide a new method for extending results on finite planar graphs to the infinite case. Thus a result of Ungar on finite graphs has the following extension: Every infinite, planar, cubic, cyclically 4‐edge‐connected graph has a representation in the plane such that every edge is a h

Dual-band planar rectangular ring microw

Dual-band planar rectangular ring microwave bandpass filter using high permittivity substrate

✍ Cheng-Hsing Hsu; Chia-Hsien Lin; Sen-Hung Huang; Chung-I G. Hsu; Cheng-Chi Yu; H 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

## Abstract Dual‐band planar bandpass filter, using two microstrip rectangular ring resonators, is proposed for wireless LAN system such as IEEE 802.11 systems (2.4 or 5 GHz). The miniaturized bandpass filter is implemented using a high permittivity dielectric substrate. The full‐wave simulator IE3

-constructibility of planar graphs

✍ C. M. Mynhardt; I. Broere 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB

## Abstract In this paper, the concept of the 𝒢‐constructibility of graphs is introduced and investigated with particular reference to planar graphs. It is conjectured that the planar graphs are minimally __N__‐constructible, where __N__ is a finite set of graphs and an infinite set 𝒢 is obtained s

Choosability of planar graphs

✍ Margit Voigt 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 175 KB

A graph G = G(EE) with lists L(v), associated with its vertices v E V, is called L-list colourable if there is a proper vertex colouring of G in which the colour assigned to a vertex v is chosen from L(v). We say G is k-choosable if there is at least one L-list colouring for every possible list assi