IPM

“ Schools ”

Astronomy
Cognitive Sciences
Computer Science
Mathematics
Nano-Science
Particles and Accelerators
Philosophy
Physics

“ Centers and Units ”

GCG Computing Group
Information Center
Iranian Light Source Facility
Iranian National Observatory
IRNIC
Library
Network Center

“ Research Groups ”

Bioinformatics
Combinatorics and Computing
Commutative Algebra
Logic
IPM HPC Laboratory

“ Useful Links ”

Gallery of Visitors
Contact Us
Gallery of Photos

“ E-Services ”

Webmail
Official Automation System
Library
Telephone Book

“School of Mathematics”

Paper IPM / M / 426

School of Mathematics

Title:

Uniquely total colorable graphs

Author(s):

1 .	S. Akbari
2 .	M. Behzad
3 .	H. Hajiabolhassan
4 .	E. S. Mahmoodian

Status:

Published

Journal:

Graphs Combin.

Vol.:

Year:

1997

Pages:

305-314

Supported by:

IPM

Abstract:

Uniquely vertex colorable graphs and uniquely edge colorable graphs have been studied extensively by different authors. The literature on the similar problem for total coloring is void. In this paper we study this concept and, among other results, we prove that if a graph G ≠ K₂ is uniquely total colorable, then χ" (G)=∆+1. Our results support the following conjecture: empty graphs, paths, and cycles of order 3k, k a natural number, are the only uniquely total colorable graphs.

Download TeX format