The Relative Maximum Genus of a Graph

C. Paul Bonnington

Research output: Contribution to journalArticleResearchpeer-review

4 Citations (Scopus)


A relative embedding of a graph in a surface with respect to a set of closed walks is one where each of the prescribed closed walks bounds a face of the embedding In the special case where the set of closed walks is empty, this amounts to the usual concept of a graph embedding. We present a formula for the maximum (orientable) genus of the surface on which a graph has a relative embedding with respect to a set of closed walks.

Original languageEnglish
Pages (from-to)195-206
Number of pages12
JournalJournal of Combinatorial Theory, Series B
Issue number2
Publication statusPublished - 1 Jan 1994
Externally publishedYes

Cite this