Articles

type: Conference
Title	Date
On the defining numbers of cartesian product of cycles	1382-04
Chromatic Classes of Certain 2-Connected Graphs	1381-06
chromaticity of generalized polygon trees	1379-04
A new bound for defining number of regular graphs	1378-12

type: Journal
Title	DOI	Date
Chromatic Equivalence Classes of Certain Generalized Polygon Trees II	#	1381-01
Chromatic equivalence classes of certain generalized polygon trees III	#	1381-01
Chromatic equivalence classes of certain cycles with edges	#	1379-01

type:
Title	Date
Star edge coloring of the Cartesian product of graphs	-
On the locating chromatic number of the cartesian product of graphs	-
On the Dominating Coloring	-
An optimal traffic distribution method supporting end-to-end delay bound	-
Local coloring of the Kneser graphs	-
A Havel-Hakimi type problem for oriented graphs	-
Characterization of randomly k-dimensional graphs	-
On the Star Coloring of Graphs	-
Locally rainbow graphs	-
Local clique covering of claw-free graphs	-
Graph Coloring: Various Types, Applications and Open Problems	-
Combinatorial Game Theory	-
The Incidence Chromatic Number of Graphs with Maximum Degree Four	-