Survey of results on the maximum genus of a graph
暂无分享,去创建一个
[1] Saul Stahl,et al. The embeddings of a graph - A survey , 1978, J. Graph Theory.
[2] Richard D. Ringeisen. Determining AII compact orientable 2-manifolds upon which Km,n has 2-cell imbeddings , 1972 .
[3] M. Jungerman,et al. A CHARACTERIZATION OF UPPER-EMBEDDABLE GRAPHS , 1978 .
[4] Richard D. Ringeisen,et al. A Kuratowski-type theorem for the maximum genus of a graph , 1972 .
[5] L. Carlitz,et al. Some Remarks on Ballot-Type Sequences of Positive Integers , 1971, J. Comb. Theory, Ser. A.
[6] Richard D. Ringeisen. Graphs of given genus and arbitrarily large maximum genus , 1973, Discret. Math..
[7] Vasanti N. Bhat. On Inequivalent Balanced Incomplete Block Designs II , 1972, J. Comb. Theory, Ser. A.
[8] Sukhamay Kundu,et al. Bounds on the number of disjoint spanning trees , 1974 .
[9] Charles H. C. Little,et al. An additivity theorem for maximum genus of a graph , 1978, Discret. Math..
[10] Richard D. Ringeisen. Upper and lower imbeddable graphs , 1972 .
[11] Martin Milgram,et al. Bounds for the genus of graphs with given Betti number , 1977, J. Comb. Theory, Ser. B.
[12] F. Harary,et al. Additivity of the genus of a graph , 1962 .
[13] Arthur T. White,et al. On the maximum genus of a graph , 1971 .
[14] Richard A. Duke. The genus, regional number, and Betti number of a graph , 1966 .
[15] Joseph Zaks,et al. The Maximum Genus of Cartesian Products of Graphs , 1974, Canadian Journal of Mathematics.