Author, Subjects, Keywords

Cited Author

 
 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » By Affiliations
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top 20 Journal Cited
 » Top 20 Cited
 » Top 20 Author Cited
 » Usage Since Sept 2007


 
 
 

Login | Create Account

Uniquely N-colorable and Chromatically Equivalent Graphs

Chao, Chong-Yun, (2001) Uniquely N-colorable and Chromatically Equivalent Graphs. Bulletin of the Malaysian Mathematical Sciences Society, 24 (1). pp. 93-103. ISSN 0126-6705

Full text not available from this repository.

Official URL: http://math.usm.my/bulletin/pdf/v24n1/v24n1p10.pdf

Affiliations

University of Pittsburgh, Dept. of Mathematics

Abstract

For each integer $n \geq 3$, we present a uniquely $n$ -colorable graph with $ 2n + 1 $ vertices, and their generalizations. For each integer $n \geq 3$, we present two uniquely $(n+1)$ -colorable graphs which are chromatically equivalent with $ 2n + 2 $ vertices, and with $ 2n + 3 $ vertices, and their generalizations.

Item Type:Journal
Subjects:Q Science, Computer Science
ID Code:1333

1. C.Y. Chao and Z. Chen, On uniquely 3-colorable graphs, Discrete Math. 112(1993), 21-27.

2. G.L. Chia, On graphs uniquely colorable under the action of their automorphism groups, Discrete Math. 162 (1996). 281-284.

3. R.C. Read, An introduction to chromatic polynomials, J. Combin. Theory 4(1968), 52-71.

4. L.J. Osterweil, Some classes of uniquely 3-colorable graphs, Discrete Math. 8(1974), 59-69.

Repository Staff Only: item control page
 
 
 
 
 
   
© Copyright 2007 MyAIS Faculty of Computer Science and Information Technology, University of Malaya – All Rights Reserved. Malaysian Abstracting and Indexing System is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.