The genus problem for cubic graphs

DOI10.1006/jctb.1996.1721zbMath0869.05024OpenAlexW1989277940MaRDI QIDQ1354116

Carsten Thomassen

Publication date: 31 August 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1996.1721

zbMATH Keywords

surfaceNP-completenesscubic graphgenus

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

Minimal quadrangulations of surfaces ⋮ Enumerating graph embeddings and partial-duals by genus and Euler genus ⋮ Genus of the Cartesian product of triangles ⋮ Calculating genus polynomials via string operations and matrices ⋮ The genus of the balanced hypercube ⋮ The Degenerate Crossing Number and Higher-Genus Embeddings

This page was built for publication: The genus problem for cubic graphs