z-logo
Premium
Enumerating the orientable 2‐cell imbeddings of complete bipartite graphs
Author(s) -
Mull Bruce P.
Publication year - 1999
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199902)30:2<77::aid-jgt2>3.0.co;2-w
Subject(s) - bipartite graph , combinatorics , mathematics , complete bipartite graph , graph , congruence (geometry) , cograph , discrete mathematics , 1 planar graph , chordal graph , geometry
A formula is developed for the number of congruence classes of 2‐cell imbeddings of complete bipartite graphs in closed orientable surfaces. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 77–90, 1999

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here