Finding Contents or People

Chromaticity of Generalised Polygon Trees
A New Bound for Defining Numbers of Regular Graphs
Some lower bounds for the L-intersection number of graphs
Randomly Dimensional Graphs
Locating Chromatic Number of Graphs
Characterization of a Class of Hamiltonian Connected Graphs
The Incidence Chromatic Number of Graphs with Maximum Degree Four
On the Star Coloring of Graphs
Chromatic equivalence classes of certain generalized polygon trees III
Chromatic equivalence classes of certain cycles with edges
2-Trees with Metric Dimension Two
Some Graphs with Vertex-Coloring 2-Edge Weighting
On Vertex-Coloring 2-Edge-Weighting of Graphs
Pairwise balanced designs and sigma clique partitions
Local coloring of the Kneser graphs