✦ LIBER ✦

Planar Lattice Graphs with Gallai’s Property

✍ Scribed by Faisal Nadeem, Ayesha Shabbir, Tudor Zamfirescu

Book ID: 120788720
Publisher: Springer Japan
Year: 2012
Tongue: English
Weight: 401 KB
Volume: 29
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-012-1177-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Forbidden subgraphs for graphs with plan

Forbidden subgraphs for graphs with planar line graphs

✍ D.L. Greenwell; Robert L. Hemminger 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 355 KB

Drawing planar graphs with circular arcs

✍ Cheng, C. C.; Duncan, C. A.; Goodrich, M. T.; Kobourov, S. G. 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 828 KB

Planar graphs with least chromatic coeff

Planar graphs with least chromatic coefficients

✍ A. Sakaloglu; A. Satyanarayana 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 512 KB

A 2-coloring of a graph G is an assignment of 2 or fewer colors to the points of G so that no two adjacent points have the same color. The number of distinct 2-colorings of an n-point and e-edge graph G can be expressed by the chromatic polynomial P(G; 2) = ~7=1(-1 )"-iai(G)2i, where ai(G) are non-n

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

Graphs with the balas—uhry property

✍ M. Kano; S. Poljak 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 287 KB

## Abstract We characterize graphs __H__ with the following property: Let __G__ be a graph and __F__ be a subgraph of __G__ such that (i) each component of __F__ is isomorphic to __H__ or __K__~2~, (ii) the order of __F__ is maximum, and (iii) the number of __H__‐components in __F__ is minimum subj

Infinite paths in planar graphs I: Graph

Infinite paths in planar graphs I: Graphs with radial nets

✍ Xingxing Yu 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB 👁 1 views

## Abstract Let __G__ be an infinite 4‐connected planar graph such that the deletion of any finite set of vertices from __G__ results in exactly one infinite component. Dean __et al__. proved that either __G__ admits a radial net or a special subgraph of __G__ admits a ladder net, and they used the