Embeddings of graphs with no short noncontractible cycles
- 1 April 1990
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 48 (2) , 155-177
- https://doi.org/10.1016/0095-8956(90)90115-g
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The graph genus problem is NP-completeJournal of Algorithms, 1989
- An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torusDiscrete Mathematics, 1987
- Uniquely and faithfully embeddable projective-planar triangulationsJournal of Combinatorial Theory, Series B, 1984
- Automorphism properties of embedded graphsJournal of Graph Theory, 1984
- Uniqueness and faithfulness of embedding of toroidal graphsDiscrete Mathematics, 1983
- Planarity and duality of finite and infinite graphsJournal of Combinatorial Theory, Series B, 1980
- Efficient Planarity TestingJournal of the ACM, 1974
- Construction and enumeration of regular maps on the torusDiscrete Mathematics, 1973
- Additivity of the genus of a graphBulletin of the American Mathematical Society, 1962
- 2-Isomorphic GraphsAmerican Journal of Mathematics, 1933