Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4650543 | Discrete Mathematics | 2008 | 5 Pages |
Abstract
The looseness of a triangular embedding of a complete graph in a closed surface is the minimum integer mm such that for every assignment of mm colors to the vertices of the embedding (such that all mm colors are used) there is a face incident with vertices of three distinct colors. In this paper we show that for every p⩾3p⩾3 there is a nonorientable triangular embedding of a complete graph with looseness at least pp.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Vladimir P. Korzhik, Jin Ho Kwak,