๐”– Bobbio Scriptorium
โœฆ   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

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
Simultaneously Colouring the Edges and F
โœ 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