Genus g Graphs Have Pagenumber O(√g)
type: Item
instance of: scholarly article
title: Genus g Graphs Have Pagenumber O(√g)
zbMATH Open document ID: 0810.68103
author: S. Malitz
published in: Journal of Algorithms
publication date: 1994-09-08T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 635853
zbMATH Keywords: book embedding
zbMATH Keywords: pagenumber
MaRDI profile type: Publication
Wikidata QID: Q56689194
full work available at URL: jagm.1994.1028
OpenAlex ID: W1980248515
DBLP publication ID: journals/jal/Malitz94a
DOI: 10.1006/JAGM.1994.1028
Recommended article: The pagenumber of genus g graphs is O( g )
Recommended article: Graphs with E Edges Have Pagenumber O(√E)
Recommended article: On the genus of the zero-divisor graph of \(\mathbb Z_n\)
Recommended article: On the genus of some total graphs
Recommended article: Q5233334
Recommended article: Bounding the Cop Number of a Graph by Its Genus
Recommended article: The bounded chromatic number for graphs of genus \(g\)
Recommended article: Q5246151
Recommended article: On the number of maximum genus embeddings of almost all graphs
Recommended article: The maximum interval number of graphs with given genus
description: scientific article; zbMATH DE number 635853