Abstract
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.
Funder
Agentúra na Podporu Výskumu a Vývoja
Vedecká Grantová Agentúra MŠVVaŠ SR a SAV
Deutscher Akademischer Austauschdienst
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)