Genus distributions for two classes of graphs

@article{Furst1989GenusDF,
  title={Genus distributions for two classes of graphs},
  author={Merrick L. Furst and Jonathan L. Gross and Richard Statman},
  journal={J. Comb. Theory, Ser. B},
  year={1989},
  volume={46},
  pages={22-36}
}
The set of orientable imbeddings of a graph can be partitioned according to the genus of the imbedding surfaces. A genus-respecting breakdown of the number of orientable imbeddings is obtained for every graph in each of two infinite classes. It is proved that the genus distribution of any member of either class is strongly unimodal. These are the first two infinite classes of graphs for which such calculations have been achieved, except for a few classes, such as trees and cycles, whose members… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-4 of 4 references

The topological theory of current graphs

  • S.R.J.L. Gross
  • J. Combinatorial Theory
  • 1974

Introduction to Combinatorial Mathematics, McGraw - Hill

  • C. L. Liu
  • 1968
1 Excerpt

A combinatorial representation for polyhedral surfaces, abstract

  • J. Edmonds
  • in Notices Amer. Math. Soc
  • 1960

Similar Papers

Loading similar papers…