|
On b-coloring of cartesian product of graphs
|
- |
|
A New Bound for Defining Numbers of Regular Graphs
|
- |
|
2-Trees with Metric Dimension Two
|
- |
|
An Enforced Hill Climbing Based System for General Game Playing
|
- |
|
An upper bound for the total restrained domination number of graphs
|
- |
|
Chromatic Classes of Certain 2-Connected Graphs
|
- |
|
Chromatic equivalence classes of certain generalized polygon trees II
|
- |
|
Metric Dimension of Graphs
|
- |
|
Max-min total restrained domination number
|
- |
|
Distance Locating Sets in Graphs
|
- |
|
Personalized Privacy Preserving Method for Social Networks Graph k-Anonymization
|
- |
|
Smallest defining number of r-regular k-chromatic graphs: r≠k. Ars Combinatoria
|
- |
|
Edge clique covering sum of graphs
|
- |
|
On incidence coloring for some graphs of maximum degree 4
|
- |
|
On the b-Coloring of Some Special Graphs
|
- |
|
A polynomial time algorithm to find the star chromatic index of trees
|
- |
|
On the local colorings of graphs
|
- |
|
Some lower bounds for the L-intersection number of graphs
|
- |
|
Unique basis graphs
|
- |
|
On the Total Restrained Domination Number
|
- |