Permutation-partition pairs: a combinatorial generalization of graph embeddings-Reference-Cited by-同舟云学术

Permutation-partition pairs: a combinatorial generalization of graph embeddings

Published:1980 Issue:1 Volume:259 Page:129-145
ISSN:0002-9947
Container-title:Transactions of the American Mathematical Society
language:en
Short-container-title:Trans. Amer. Math. Soc.

Author:

Stahl Saul

Abstract

Permutation-partition pairs are a purely combinatorial generalization of graph embeddings. Some parameters are defined here for these pairs and several theorems are proved. These results are strong enough to prove virtually all the known theoretical informaton about the genus parameter as well as a new theorem regarding the genus of the amalgamation of two graphs over three points.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/tran/1980-259-01/S0002-9947-1980-0561828-2/S0002-9947-1980-0561828-2.pdf

Reference14 articles.

1. The genera of amalgamations of graphs;Alpert, Seth R.;Trans. Amer. Math. Soc.,1973

2. \bysame, The genera of edge amalgamations of complete bigraphs (in preparation).

3. Additivity of the genus of a graph;Battle, Joseph;Bull. Amer. Math. Soc.,1962

4. A. Cayley, On the colouring of maps, Proc. London Math. Soc. 9 (1878), 148.

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Inflation Improves Graph Neural Networks;Proceedings of the ACM Web Conference 2022;2022-04-25

2. On the genus distributions of wheels and of related graphs;Discrete Mathematics;2018-04

3. An Euler-genus approach to the calculation of the crosscap-number polynomial;Journal of Graph Theory;2017-09-12

4. Trading crossings for handles and crosscaps;Journal of Graph Theory;2001

5. References;North-Holland Mathematics Studies;2001