Maximum genus, girth and connectivity
type: Item
instance of: scholarly article
title: Maximum genus, girth and connectivity
zbMATH Open document ID: 0960.05040
author: Deming Li
author: Yanpei Liu
published in: European Journal of Combinatorics
publication date: 2001-05-10T00:00:00Z
review text: This paper examines the relationship between the maximum genus of a simple graph and its girth and connectivity. Some general upper bounds are given in terms of the Betti number of the graph. Lower bounds are given for girths 3 through 10 and 12 using the known values for the minimum number of cubic vertices in a graph of given girth.
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1512037
zbMATH Keywords: maximum genus
zbMATH Keywords: Betti number
zbMATH Keywords: girth
zbMATH Keywords: connectivity
reviewed by: Dan S. Archdeacon
MaRDI profile type: Publication
full work available at URL: eujc.1999.0398
OpenAlex ID: W2067760896
cites work: Maximum genus and connectivity
cites work: A tight lower bound on the maximum genus of a simplicial graph
cites work: Q3757929
cites work: Maximum genus and girth of graphs
cites work: Maximum genus and maximum nonseparating independent set of a 3-regular graph
cites work: The maximum genus of graphs with diameter three
cites work: A Characterization in of Upper-Embeddable Graphs
cites work: Bounds of the number of disjoint spanning trees
cites work: A new bound on the feedback vertex sets in cubic graphs
cites work: A new characterization of the maximum genus of a graph
cites work: A Kuratowski-type theorem for the maximum genus of a graph
cites work: Q5524326
cites work: Q3216652
cites work: How to determine the maximum genus of a graph
DOI: 10.1006/EUJC.1999.0398
description: scientific article; zbMATH DE number 1512037