✦ LIBER ✦

On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane

✍ Scribed by Jan Kára; Attila Pór; David R. Wood

Publisher: Springer
Year: 2005
Tongue: English
Weight: 217 KB
Volume: 34
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-005-1177-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Visibility Graphs of Point Sets in the P

Visibility Graphs of Point Sets in the Plane

✍ Florian Pfender 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 222 KB

On the harmonious chromatic number of a

On the harmonious chromatic number of a graph

✍ John Mitchem 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 755 KB

The harmonious chromatic number of a graph G, denoted by h(G), is the least number of colon which can be assigned to the vertices of G such that adjacent vertices are colored differently and any two distinct edges have different color pairs. This is a slight variation of a definition given independe

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

A bound on the chromatic number of a gra

A bound on the chromatic number of a graph

✍ Paul A. Catlin 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 392 KB

We give an upper bound on the chromatic number of a graph in terms of its maximum degree and the size of the largest complete subgraph. Our result extends a theorem due to i3rook.s.

The star chromatic number of a graph

✍ H. L. Abbott; B. Zhou 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 469 KB 👁 2 views

## Abstract We study a generalization of the notion of the chromatic number of a graph in which the colors assigned to adjacent vertices are required to be, in a certain sense, far apart. © 1993 John Wiley & Sons, Inc.

The chromatic covering number of a graph

✍ Reza Naserasr; Claude Tardif 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

Following [1] , we investigate the problem of covering a graph G with induced subgraphs G 1 ; . . . ; G k of possibly smaller chromatic number, but such that for every vertex u of G, the sum of reciprocals of the chromatic numbers of the G i 's containing u is at least 1. The existence of such ''ch