The genus problem for cubic graphs

DOI10.1006/JCTB.1996.1721MaRDI QIDQ1354116zbMATH OpenOpenAlexFDO

Authors 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

cubic graphgenusNP-completenesssurface

Mathematics Subject Classification ID

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

Recommendations

• Triangulating a surface with a prescribed graph
• Embeddings of circular graphs
• scientific article; zbMATH DE number 867666
• scientific article; zbMATH DE number 3857154
• Existence of polyhedral embeddings of graphs

Cited in

(14)

• Triangulating a surface with a prescribed graph
• Minimal quadrangulations of surfaces
• Settling the genus of the n-prism
• The genus of the balanced hypercube
• Embeddings of circular graphs
• scientific article; zbMATH DE number 3931037 (Why is no real title available?)
• The decycling number and maximum genus of cubic graphs
• Calculating genus polynomials via string operations and matrices
• The degenerate crossing number and higher-genus embeddings
• Enumerating graph embeddings and partial-duals by genus and Euler genus
• scientific article; zbMATH DE number 6297701 (Why is no real title available?)
• Existence of polyhedral embeddings of graphs
• Efficient polynomial-time approximation scheme for the genus of dense graphs
• Genus of the Cartesian product of triangles

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

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