KURATOWSKI-TYPE THEOREMS FOR AVERAGE GENUS Academic Article

abstract

• Graphs of small average genus are characterized. In particular, a Kuratowski-type theorem is obtained: except for finitely many graphs, a cutedge-free graph has average genus less than or equal to 1 if and only if it is a necklace. We provide a complete list or those exceptions. A Kuratowski-type theorem for graphs of maximum genus 1 is also given. Some of the methods used in obtaining these results involve variations of a classical result of Whitney. 1993 by Academic Press, Inc.

authors

• Chen, Jianer

published proceedings

• JOURNAL OF COMBINATORIAL THEORY SERIES B

author list (cited authors)

• CHEN, J., & GROSS, J. L.

citation count

• 23

complete list of authors

• CHEN, J||GROSS, JL

publication date

• January 1993

publisher

• Elsevier  Publisher

published in

• Journal of Combinatorial Theory: Series B  Journal

Digital Object Identifier (DOI)

• 10.1006/jctb.1993.1009

start page

• 100

end page

• 121

volume

• 57

issue

• 1

URL

• http%3A%2F%2Fdx.doi.org%2F10.1006%2Fjctb.1993.1009