✦ LIBER ✦

On the Number of Plane Geometric Graphs

✍ Scribed by Oswin Aichholzer; Thomas Hackl; Clemens Huemer; Ferran Hurtado; Hannes Krasser; Birgit Vogtenhuber

Publisher: Springer Japan
Year: 2007
Tongue: English
Weight: 262 KB
Volume: 23
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-007-0704-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the chromatic number of random geomet

On the chromatic number of random geometric graphs

✍ Colin Mcdiarmid; Tobias Müller 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 684 KB

On Geometric Graph Ramsey Numbers

✍ Gyula Károlyi; Vera Rosta 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 179 KB

On the d-distance face chromatic number

On the d-distance face chromatic number of plane graphs

✍ Mirko Horňák; Stanislav Jendrol' 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 223 KB

The d-distance face chromatic number of a connected plane graph G is the minimum number of colours in such a colouring of faces of G that whenever two distinct faces are at the distance at most d, they receive distinct colours. We estimate the d-distance face chromatic number from above for connecte

Structural theorem on plane graphs with

Structural theorem on plane graphs with application to the entire coloring number

✍ Borodin, Oleg V. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 477 KB 👁 1 views

In 1973, Kronk and Mitchem (Discrete Math. (5) 255-260) conjectured that the vertices, edges and faces of each plane graph G may be colored with D(G) + 4 colors, where D(G) is the maximum degree of G, so that any two adjacent or incident elements receive distinct colors. They succeeded in verifying

Upper Bounds of Entire Chromatic Number

Upper Bounds of Entire Chromatic Number of Plane Graphs

✍ W. Weifan 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 35 KB

The entire chromatic number χ ve f (G) of a plane graph G is the least number of colors assigned to the vertices, edges and faces so that every two adjacent or incident pair of them receive different colors. conjectured that χ ve f (G) ≤ + 4 for every plane graph G. In this paper we prove the conj

Edge-face chromatic number and edge chro

Edge-face chromatic number and edge chromatic number of simple plane graphs

✍ Rong Luo; Cun-Quan Zhang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

## Abstract Given a simple plane graph __G__, an edge‐face __k__‐coloring of __G__ is a function ϕ : __E__(__G__) ∪ __F__(G) → {1,…,__k__} such that, for any two adjacent or incident elements __a__, __b__ ∈ __E__(__G__) ∪ __F__(__G__), ϕ(__a__) ≠ ϕ(__b__). Let χ~e~(__G__), χ~ef~(__G__), and Δ(__G_