• ON PROPERTIES AND IMPLICATIONS FOR CONDITIONAL CHROMATIC NUMBER OF GRAPHS

Abstract

Let a graph will refer to vertex set , with , and edge set with in addition to nodes and lines. A cycle (or -cycle) is a simple cycle. In this paper we investigate the properties of the conditional chromatic number of graph . The point arboricity for a family of graphs is also an upper bound for -chromatic numbers. We establish the implications for from .