In this paper, we introduce a class of graphs which we call average hereditary graphs. Many graphs that occur in the usual graph theory applications belong to this class of graphs. Many popular types of graphs fall under this class, such as regular graphs, trees and other popular classes of graphs. The paper aims to explore some interesting properties regarding colorings average hereditary graphs. We prove a new upper bound for the chromatic number of a graph in terms of its maximum average degree and show that this bound is an improvement on previous bounds. From this, we show a relationship between the average degree and the chromatic number of an average hereditary graph. We then show that even with new bound, the graph 3-coloring problem remains NP-hard when the input is restricted to average hereditary graphs. We provide an equivalent condition for a graph to be average hereditary, through which we show that we can decide if a given graph is average hereditary in polynomial time.