✦ LIBER ✦

Colouring proximity graphs in the plane

✍ Scribed by Colin McDiarmid; Bruce Reed

Book ID: 108316296
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 897 KB
Volume: 199
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00292-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Entire colouring of plane graphs

✍ Weifan Wang; Xuding Zhu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 210 KB

Acyclic edge colouring of plane graphs

✍ Anna Fiedorowicz 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 319 KB

Simultaneously Colouring the Edges and F

Simultaneously Colouring the Edges and Faces of Plane Graphs

✍ Adrian O. Waller 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 345 KB

In a simultaneous colouring of the edges and faces of a plane graph we colour edges and faces so that every two adjacent or incident pair of them receive different colours. In this paper we prove a conjecture of Mel'nikov which states that for this colouring every plane graph can be coloured with 2+

Note on the colouring of graphs

✍ G. A. Dirac 📂 Article 📅 1951 🏛 Springer-Verlag 🌐 French ⚖ 400 KB

Colouring the discretization graphs aris

Colouring the discretization graphs arising in the multigrid method

✍ Gisbert Stoyan; Robert Stoyan 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 568 KB

Colouring Arcwise Connected Sets in the

Colouring Arcwise Connected Sets in the Plane I

✍ Sean McGuinness 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 154 KB