On the maximum order of graphs embedded in surfaces
type: Item
instance of: scholarly article
title: On the maximum order of graphs embedded in surfaces
zbMATH Open document ID: 1334.05028
author: Eran Nevo
author: Guillermo Pineda-Villavicencio
author: David R. Wood
published in: Journal of Combinatorial Theory. Series B
publication date: 2016-04-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/1312.1753
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 6571679
zbMATH Keywords: degree-diameter problem
zbMATH Keywords: graphs on surfaces
zbMATH Keywords: surface
zbMATH Keywords: vertex separator
MaRDI profile type: Publication
OpenAlex ID: W70497260
arXiv ID: 1312.1753
cites work: Spanning trees of dual graphs
cites work: Q5834367
cites work: Q3577833
cites work: Q3737448
cites work: Large planar graphs with given diameter and maximum degree
cites work: Constructions of large planar networks with given degree and diameter
cites work: Constructions of large graphs on surfaces
cites work: Largest planar graphs of diameter two and fixed maximum degree
cites work: Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface
cites work: A Separator Theorem for Planar Graphs
cites work: Moore graphs and beyond: a survey of the degree/diameter problem
cites work: Graphs on surfaces
cites work: The degree-diameter problem for sparse graph classes
cites work: The cycle space of an embedded graph
cites work: Q4680154
cites work: Spanning subgraphs of embedded graphs
cites work: \(N\)-separators in planar graphs
cites work: Maximum size of a planar graph with given degree and even diameter
DOI: 10.1016/J.JCTB.2015.12.004
description: scientific article; zbMATH DE number 6571679