The relative maximum genus of a graph

DOI10.1006/JCTB.1994.1013MaRDI QIDQ1322015zbMATH OpenOpenAlexFDO

Authors C. Paul Bonnington

Publication date 5 May 1994

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jctb.1994.1013

zbMATH Keywords

closed walksembeddinggenussurface

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Review text

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.

Recommendations

• A relative maximum genus graph embedding and its local maximum genus
• A Nebeský-type characterization for relative maximum genus
• Relative Embeddings of Graphs on Closed Surfaces
• scientific article; zbMATH DE number 9847

Cited in

(16)

• A Nebeský-type characterization for relative maximum genus
• Maximum genus and girth of graphs
• Maximum genus and chromatic number of graphs
• A relative maximum genus graph embedding and its local maximum genus
• Maximum genus embeddings of Steiner triple systems
• Maximum genus of a graph in terms of its embedding properties.
• Results of the maximum genus of graphs
• scientific article; zbMATH DE number 5630189 (Why is no real title available?)
• Relative Embeddings of Graphs on Closed Surfaces
• The maximum interval number of graphs with given genus
• scientific article; zbMATH DE number 9847 (Why is no real title available?)
• scientific article; zbMATH DE number 97632 (Why is no real title available?)
• The maximum genus, matchings and the cycle space of a graph
• scientific article; zbMATH DE number 3993607 (Why is no real title available?)
• Pre-signed graphs: a reformulation of signed graphs and their embeddings
• Bi-eulerian embeddings of graphs and digraphs

This page was built for publication: The relative maximum genus of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322015)