Maximum genus, connectivity, and Nebeský's theorem

DOI10.26493/1855-3974.356.66EMaRDI QIDQ3466844zbMATH OpenOpenAlexFDO

Authors Michal Kotrbčík, Roman Nedela, Martin Škoviera, Dan S. Archdeacon

Publication date 25 January 2016

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.356.66e

zbMATH Keywords

Betti numberconnectivitycycle rankmaximum genusNebeský's theorem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• Maximum genus and connectivity
• Lower bounds on the maximum genus of a connected graph
• On the lower bounds for the maximum genus for simple graphs
• A note on lower bounds for maximum genus
• Maximum genus, girth and connectivity

Cited in

(5)

• scientific article; zbMATH DE number 495474 (Why is no real title available?)
• scientific article; zbMATH DE number 1827804 (Why is no real title available?)
• Lower bounds for the maximum genus of 4-regular graphs
• Maximum genus and independent set.
• New bounds for the average genus and average number of faces of a simple graph

This page was built for publication: Maximum genus, connectivity, and Nebeský's theorem

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