𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Grid Drawings of 4-Connected Plane Graphs

✍ Scribed by K. Miura; S. Nakano; T. Nishizeki

Publisher
Springer
Year
2001
Tongue
English
Weight
322 KB
Volume
26
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Box-Rectangular Drawings of Plane Graphs
Box-Rectangular Drawings of Plane Graphs
✍ Md.Saidur Rahman; Shin-ichi Nakano; Takao Nishizeki πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 413 KB

In this paper we introduce a new drawing style of a plane graph G called a box-rectangular drawing. It is defined to be a drawing of G on an integer grid such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line segment or a vertical line segment, a

3D straight-line grid drawing of 4-color
3D straight-line grid drawing of 4-colorable graphs
✍ Tiziana Calamoneri; Andrea Sterbini πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 438 KB

In this paper we contribute to the understanding of the geometric properties of 3D drawings. Namely, we show how to make a 3D straight-line grid drawing of 4-colorable graphs in 0( n\*) volume. Moreover, we prove that each bipartite graph needs at least a( n3/\*) volume. @

Non-rainbow colorings of 3-, 4- and 5-co
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
✍ ZdenΔ›k DvoΕ™Γ‘k; Daniel KrΓ‘l'; Riste Ε krekovski πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 166 KB πŸ‘ 1 views

## Abstract We study vertex‐colorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If __G__ is a 3 ‐connected plane graph with __n__ vertices, then the number of colors in such a coloring does not exceed $\lfloor{{7n-8}\over {9}}\rfloo

Hamiltonicity of 4-connected graphs
Hamiltonicity of 4-connected graphs
✍ Hao Li; Feng Tian; Zhi Xia Xu πŸ“‚ Article πŸ“… 2010 πŸ› Institute of Mathematics, Chinese Academy of Scien 🌐 English βš– 230 KB