Paper on project-1 Abstract:The Total coloring conjecture states that any simple graph G with maximum degree D can be totally colored with at most D+2 colors. In this paper, we have obtained the total chromatic number for some classes of Cayley graphs.
-
Notifications
You must be signed in to change notification settings - Fork 0
prajnanaswaroopa/Paper-1
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Paper on project-1
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published