Face covers and the genus problem for apex graphs

Journal of Combinatorial Theory. Series B

Volumn 82, Issue 1, 2001, Pages 102-117

  Mohar, Bojan ^a  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035343730     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2000.2026     Document Type: Article

References (13)

1. Bienstock D., Dean N. On obstructions to small face covers in planar graphs. J. Combin. Theory Ser. B. 55:1992;163-189.
2. Bienstock D., Monma C. L. On the complexity of covering vertices by faces in a planar graph. SIAM J. Comput. 17:1988;53-76.
3. Garey M. R., Johnson D. S. Computers and Intractability: A Guide to the Theory of the NP-Completeness. 1979;Freeman, San Francisco.
4. Garey M. R., Johnson D. S., Stockmeyer L. Some simplified NP-complete graph problems. Theor. Comput. Sci. 1:1976;237-267.
5. Garey M. R., Johnson D. S., Tarjan R. E. The planar Hamiltonian circuit problem is NP-complete. SIAM J. Comput. 1976;704-714.
6. Gross J. L., Tucker T. W. Topological Graph Theory. 1987;Wiley-Interscience, New York.
7. Kratochvil J. A special planar satisfiability problem and a consequence of its NP-completeness. Discrete Appl. Math. 52:1994;233-252.
8. Mohar B. Uniqueness and minimality of large face-width embeddings of graphs. Combinatorica. 15:1995;541-556.
9. Mohar B., Thomassen C. Graphs on Surfaces. 2001;The Johns Hopkins University Press, Baltimore.
10. Ringel G. Map Color Theorem. 1974;Springer-Verlag, Berlin.
11. Thomassen C. The graph genus problem is NP-complete. J. Algorithms. 10:1989;568-576.
12. Thomassen C. Triangulating a surface with a prescribed graph. J. Combin. Theory Ser. B. 57:1993;196-206.
13. White A. T. Graphs, Groups and Surfaces. 1973;North-Holland, Amsterdam.