Articles

type: Conference
Title Date
On the defining numbers of cartesian product of cycles
Chromatic Classes of Certain 2-Connected Graphs
chromaticity of generalized polygon trees
A new bound for defining number of regular graphs
type: Journal
Title DOI Date
Chromatic Equivalence Classes of Certain Generalized Polygon Trees II #
Chromatic equivalence classes of certain generalized polygon trees III #
Chromatic equivalence classes of certain cycles with edges #
type:
Title Date
Characterization of randomly k-dimensional graphs -
On the Star Coloring of Graphs -
A Havel-Hakimi type problem for oriented graphs -
Locally rainbow graphs -
Local clique covering of claw-free graphs -
Combinatorial Game Theory -
The Incidence Chromatic Number of Graphs with Maximum Degree Four -
Graph Coloring: Various Types, Applications and Open Problems -
On construction of involutory MDS matrice from Vandermonde Matrices in GF(2q) -
On the simultaneous edge coloring of graphs -
Locating Chromatic Number of Graphs -
Injective chromatic number of outer planar graphs -
On randomly k-dimentional graphs -