|
A Note on the p-Prime Algorithm for Solving the Maximum Independent Set Problem
|
- |
|
Characterization of a Class of Hamiltonian Connected Graphs
|
- |
|
Randomly Dimensional Graphs
|
- |
|
On the Star Coloring of Graphs
|
- |
|
The Incidence Chromatic Number of Graphs with Maximum Degree Four
|
- |
|
Locating Chromatic Number of Graphs
|
- |
|
Some Graphs with Vertex-Coloring 2-Edge Weighting
|
- |
|
Chromatic equivalence classes of certain cycles with edges
|
- |
|
On Vertex-Coloring 2-Edge-Weighting of Graphs
|
- |
|
2-Trees with Metric Dimension Two
|
- |
|
Chromatic equivalence classes of certain generalized polygon trees II
|
- |
|
Smallest defining number of r-regular k-chromatic graphs: r≠k. Ars Combinatoria
|
- |
|
Chromatic equivalence classes of certain generalized polygon trees III
|
- |
|
On the defining sets of some special graphs
|
- |
|
On the local colorings of graphs
|
- |
|
Constructing regular graphs with smallest defining number
|
- |
|
Local coloring of the Kneser graphs
|
- |
|
Locally rainbow graphs
|
- |
|
On construction of involutory MDS matrice from Vandermonde Matrices in GF(2q)
|
- |
|
On b-coloring of Kneser graphs
|
- |