Paper Info
Title
Unique-maximum edge-colouring of plane graphs with respect to faces.
Abstract
A unique-maximum k-edge-colouring with respect to faces of a 2-edge-connected plane graph G is an edge-colouring with colours 1,…,k so that, for each face α of G, the maximum colour occurs exactly once on the edges of α. We prove that any 2-edge-connected plane graph has such a colouring with 3 colours. If we require the colouring to be facially proper then 6 colours are enough.
Year
DOI
Venue
2015
10.1016/j.dam.2014.12.002
Discrete Applied Mathematics
Keywords
DocType
Volume
Plane graph,Edge-colouring,Unique-maximum colouring
Journal
185
Issue
ISSN
Citations 
C
0166-218X
6
PageRank 
References 
Authors
0.94
7
3
Name
Order
Citations
PageRank
Igor Fabrici160.94
Stanislav Jendrol260.94
Michaela Vrbjarová381.64