NONORIENTABLE TRIANGULAR EMBEDDINGS OF COMPLETE GRAPHS WITH ARBITRARILY LARGE LOOSENESS
SCIE
SCOPUS
- Title
- NONORIENTABLE TRIANGULAR EMBEDDINGS OF COMPLETE GRAPHS WITH ARBITRARILY LARGE LOOSENESS
- Authors
- Korzhik, VP; Kwak, JH
- Date Issued
- 2008-08-06
- Publisher
- ELSEVIER SCIENCE BV
- Abstract
- The looseness of a triangular embedding of a complete graph in a closed surface is the minimum integer m such that for every assignment of m colors to the vertices of the embedding (such that all m colors are used) there is a face incident with vertices of three distinct colors. In this paper we show that for every p >= 3 there is a nonorientable triangular embedding of a complete graph with looseness at least p. (C) 2007 Elsevier B.V. All rights reserved.
- Keywords
- topological embedding; triangular embedding; complete graph; looseness; Steiner triple system
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/22693
- DOI
- 10.1016/j.disc.2007.06.023
- ISSN
- 0012-365X
- Article Type
- Article
- Citation
- DISCRETE MATHEMATICS, vol. 308, no. 15, page. 3208 - 3212, 2008-08-06
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.