On the orientable genus of graphs with bounded nonorientable genus
type: Item
instance of: scholarly article
title: On the orientable genus of graphs with bounded nonorientable genus
zbMATH Open document ID: 0889.05040
DOI: 10.1016/S0012-365X(97)00144-1
author: Bojan Mohar
published in: Discrete Mathematics
publication date: 1998-02-25T00:00:00Z
review text: A conjecture of \textit{N. Robertson} and \textit{R. Thomas} [J. Graph Theory 15, No. 4, 407-419 (1991; Zbl 0735.05031)] on the orientable genus of graphs with a given nonorientable embedding is disproved.
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 1121500
zbMATH Keywords: orientable genus
zbMATH Keywords: embedding
reviewed by: Chris Jagger
MaRDI profile type: Publication
cites work: Q5724434
cites work: Computing the orientable genus of projective graphs
cites work: Q3757929
cites work: On the orientable genus of graphs embedded in the klein bottle
cites work: Q3972954
cites work: The graph genus problem is NP-complete
Recommended article: On the non-orientable genus of a 2-connected graph
Recommended article: Nonorientable genus of nearly complete bipartite graphs
Recommended article: On the orientable genus of graphs embedded in the klein bottle
Recommended article: On the gonality of graphs and connections to orientable genus
Recommended article: Orientable and Nonorientable Genera for Some Complete Tripartite Graphs
Recommended article: Settling the nonorientable genus of the nearly complete bipartite graphs
Recommended article: The orientable genus of some joins of complete graphs with large edgeless graphs
Recommended article: The nonorientable genus of some Jacobson graphs and classification of the projective ones
Recommended article: The nonorientable genus of joins of complete graphs with large edgeless graphs
Recommended article: The nonorientable genus of complete tripartite graphs
description: scientific article; zbMATH DE number 1121500