4 search results - page 1 / 1 » 3-facial colouring of plane graphs |
CORR
2006
Springer
13 years 11 months ago
2006
Springer
JGT
2007
13 years 10 months ago
2007
A cyclic colouring of a plane graph is a vertex colouring such that vertices incident with the same face have distinct colours. The minimum number of colours in a cyclic colouring...
SIROCCO
2007
14 years 8 days ago
2007
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
GD
2005
Springer
14 years 4 months ago
2005
Springer
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...