Facial Homogeneous Colouring of Graphs
A proper colouring of a plane graph G is called facially homogeneous if it uses the same number of colours for every face of G. We study various sufficient conditions of facial homogeneous colourability of plane graphs, its relation to other facial colourings, and the extension of this concept for embedded graphs in general.
2017 ◽
Vol 09
(01)
◽
pp. 1750011
◽
2012 ◽
Vol 21
(14)
◽
pp. 1250129
◽
Keyword(s):
2013 ◽
Vol 23
(02)
◽
pp. 75-92
◽
Keyword(s):
2006 ◽
Vol 17
(05)
◽
pp. 1031-1060
◽
Keyword(s):
2009 ◽
Vol 18
(12)
◽
pp. 1711-1726
◽
Keyword(s):
2019 ◽
Vol 28
(14)
◽
pp. 1950085
Keyword(s):
2007 ◽
Vol 17
(03)
◽
pp. 201-230
◽
Keyword(s):