ACHROMATIC NUMBERS OF MAXIMAL OUTERPLANAR GRAPHS
スポンサーリンク
概要
- 論文の詳細を見る
A complete k-coloring of a graph ＄G＄ is a map from the vertices of ＄G＄ to ＄k＄ colors such that any two adjacent vertices get different colors and that any two different colors appear on the two endpoints of some edge. The achromatic number of ＄G＄ is the largest ＄k＄ such that ＄G＄ has a complete k-coloring. In this paper, we give a lower bound for the achromatic numbers of maximal outerplanar graphs.
- Yokohama City University and Yokohama National Universityの論文
- 2002-00-00
Yokohama City University and Yokohama National University | 論文
- UNIVERSAL SPACES FOR ZERO-DIMENSIONAL CLOSED IMAGES OF METRIC SPACES : dedicate to my mother on her 77th birthday
- A TOPOLOGICAL APPROACH TO THE NIELSEN'S REALIZATION PROBLEM FOR HAKEN 3-MANIFOLDS
- ON A CERTAIN CLASS OF FUNCTIONS OF BOUNDED BOUNDARY ROTATION
- ON THE SWITCHBACK VERTION OF JOSEPHUS PROBLEM
- ON EXISTENCE OF SOLUTIONS FOR THE UNILATERAL PROBLEM ASSOCIATED TO THE DEGENERATE KIRCHHOFF EQUATIONS