On the circular chromatic number of deleted vertex subgraphs
Author & Affiliation:
R. Ganapathy Raman
Lecturer, Department of Maths, D.G., Vaishnav College, Chennai & Research Scholar in Scsvmvu (INDIA)
R. Sattanathan (sreeda.arun@gmail.com)
Reader & H.O.D, of maths, D.G., Vaishanav College, Chennai (INDIA) (Sri Chandra Sekara Sarasawathi Viswamaha Vidyalaya, University, Kanchipuram (INDIA)
Keyword:
Chromatic numbers , star, number.
Issue Date:
December 2008
Abstract:
An alternative approach to the existence of a vertex n Î V(G) such that c(G - n) ³ c(G) - 1 is presented. If such a vertex exists for a planar graph, we show that there must also be one of minimum degree.
Pages:
709-712
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
PDF:
DOI:
jusps-A
Share This:
Copy the following to cite this article:
R. G. Raman; R. Sattanathan, "On the circular chromatic number of deleted vertex subgraphs", Journal of Ultra Scientist of Physical Sciences, Volume 20, Issue 3, Page Number 709-712, 2018Copy the following to cite this URL:
R. G. Raman; R. Sattanathan, "On the circular chromatic number of deleted vertex subgraphs", Journal of Ultra Scientist of Physical Sciences, Volume 20, Issue 3, Page Number 709-712, 2018Available from: https://www.ultrascientist.org/paper/1433/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
