On the girth and genus of a graph

M. Behzad and G. Chartrand, Introduction to the Theory of Graphs, Allyn and Bacon, Boston, 1972.
MATH Google Scholar
L. W. Beineke and F. Harary, The genus of the n-cube, Canad. J. Math. 17 (1965), 494–496.
Article MathSciNet MATH Google Scholar
C. T. Benson, Minimal regular graphs of girth eight and twelve, Canad. J. Math. 18 (1966), 1091–1094.
Article MathSciNet MATH Google Scholar
R. A. Duke, How is a graph's Betti number related to its genus?, Amer. Math. Monthly 78 (1971), 386.
Article MathSciNet MATH Google Scholar
_____, The genus, regional number, and Betti number of a graph, Canad. J. Math. 18 (1966), 817–822.
Article MathSciNet MATH Google Scholar
J. R. Edmonds, A combinatorial representation for polyhedral surfaces, Notices Amer. Math. Soc. 7 (1960), 646.
Google Scholar
R. Guy and V. Klee, Monthly Research Problems, 1969–71, Amer. Math. Monthly 78 (1971), 1113–1122.
Article MathSciNet Google Scholar
F. Harary, Graph Theory, Addison-Wesley, Reading, 1969.
MATH Google Scholar
E. A. Nordhaus, B. M. Stewart, and A. T. White, On the maximum genus of a graph, J. Combinatorial Theory, Ser. B. 11 (1971), 258–267.
Article MathSciNet MATH Google Scholar
E. A. Nordhaus, R. D. Ringeisen, B. M. Stewart, and A. T. White, A Kuratowski-type theorem for the maximum genus of a graph, J. Combinatorial Theory, Ser. B. 12 (1972), 260–267.
Article MathSciNet MATH Google Scholar
R. D. Ringeisen, Determining all compact orientable 2-manifolds upon which K_m,n has 2-cell imbeddings, J. Combinatorial Theory, Ser. B. 12 (1972), 101–104.
Article MathSciNet MATH Google Scholar
G. Ringel, Das Geschlecht des vollständigen paaren Graphen, Abh. Math. Sem. Univ. Hamburg 28 (1965), 139–150.
Article MathSciNet MATH Google Scholar
_____, Über drei Kombinatorische Problem am n-dimensionalen Würfel and Würfelgitter, Abh. Math. Sem. Univ. Hamburg 20 (1955), 10–19.
Article MathSciNet MATH Google Scholar
G. Ringel and J. W. T. Youngs, Solution of the Heawood Mapcoloring problem, Proc. Nat. Acad. Sci. U.S.A. 60 (1968), 438–445.
Article MathSciNet MATH Google Scholar
W. T. Tutte, Connectivity in Graphs, Univ. of Toronto Press, 1966.
Google Scholar
A. T. White, The genus of the complete tripartite graph K_mn,n,n, J. Combinatorial Theory 7 (1969), 283–285.
Article MathSciNet MATH Google Scholar
_____, The genus of repeated cartesian products of bipartite graphs, Trans. Amer. Math. Soc. 151 (1970), 393–404.
Article MathSciNet MATH Google Scholar
_____, On the genus of a group, Trans. Amer. Math. Soc., to appear.
Google Scholar
J. W. T. Youngs, Minimal imbeddings and the genus of a graph, J. Math. Mech. 12 (1963), 303–315.
MathSciNet MATH Google Scholar

Download references

Author information

Authors and Affiliations

Michigan State University, 48823, East Lansing, MI
E. A. Nordhaus

Authors

E. A. Nordhaus
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Y. Alavi D. R. Lick A. T. White

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Nordhaus, E.A. (1972). On the girth and genus of a graph. In: Alavi, Y., Lick, D.R., White, A.T. (eds) Graph Theory and Applications. Lecture Notes in Mathematics, vol 303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0067373

Download citation

DOI: https://doi.org/10.1007/BFb0067373
Published: 27 August 2006
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06096-3
Online ISBN: 978-3-540-38114-3
eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

On the girth and genus of a graph

Access this chapter

Preview

References