4 search results - page 1 / 1 » 3-facial colouring of plane graphs |
42
Voted
CORR
2006
Springer
15 years 14 days ago
2006
Springer
101
Voted
JGT
2007
15 years 10 days 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...
121
click to vote
SIROCCO
2007
15 years 1 months 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...
95
Voted
GD
2005
Springer
15 years 6 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...