Finding Contents or People

Characterization of a Class of Hamiltonian Connected Graphs
The Incidence Chromatic Number of Graphs with Maximum Degree Four
A Note on the p-Prime Algorithm for Solving the Maximum Independent Set Problem
On the Star Coloring of Graphs
On the b-Coloring of Some Special Graphs
Local Chromatic Number of Graphs
Distance Locating Sets in Graphs
Chromatic Classes of Certain 2-Connected Graphs
A New Bound for Defining Numbers of Regular Graphs
Star coloring and tree-width of Kneser graph KG(n; 2)
Small oriented cycle double cover of graphs
On the simultaneous edge coloring of graphs
Local clique covering of claw-free graphs
Some lower bounds for the L-intersection number of graphs
Edge clique covering sum of graphs