Upper-embeddable graphs and related topics
- 1 April 1979
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 26 (2) , 226-232
- https://doi.org/10.1016/0095-8956(79)90059-5
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- How to determine the maximum genus of a graphJournal of Combinatorial Theory, Series B, 1979
- Bounds on the number of disjoint spanning treesJournal of Combinatorial Theory, Series B, 1974
- A Kuratowski-type theorem for the maximum genus of a graphJournal of Combinatorial Theory, Series B, 1972
- On the maximum genus of a graphJournal of Combinatorial Theory, Series B, 1971
- Additivity of the genus of a graphBulletin of the American Mathematical Society, 1962