D. Michalak, “On Middle and Total Graphs with Coarseness Number Equal 1,” Lecture Notes in Mathematics, Vol. 1018, 1983, pp. 139-150.
has been cited by the following article:
TITLE: Further Results on Acyclic Chromatic Number
AUTHORS: P. Shanas Babu, A. V. Chithra
KEYWORDS: Acyclic Coloring; Acyclic Chromatic Number; Central Graph; Middle Graph; Total Graph
JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.3 No.2, April 29, 2013
ABSTRACT: An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees.The purpose of this paper is to derive exact values of acyclic chromatic number of some graphs.