Abstract
We prove that the following problem is NP-complete: Given a cubic graph G and a natural number g, is it possible to draw G on the sphere with g handles added? © 1997 Academic Press.
Cite
CITATION STYLE
APA
Thomassen, C. (1997). The genus problem for cubic graphs. Journal of Combinatorial Theory. Series B, 69(1), 52–58. https://doi.org/10.1006/jctb.1996.1721
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free