Abstract
A particular kind of 2-cell embeddings, called regular, for arc-coloured digraphs is introduced, and a method for constructing both orientable and non-orientable regular embeddings is presented. Furthermore, by using combinatorial concepts and the Euler-Poincare formula, we derive upper bounds for both the orientable and non-orientable genera of such arc-coloured digraphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
