|
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
|
- |
|
Star Edge Coloring of Cartesian Product of Graphs
|
- |
|
Constructing regular graphs with smallest defining number
|
- |
|
Pairwise balanced designs and sigma clique partitions
|
- |
|
Characterization of n-vertex graphs with metric dimension n-3
|
- |
|
A Note on the p-Prime Algorithm for Solving the Maximum Independent Set Problem
|
- |
|
Star Edge Coloring of Cactus Graphs
|
- |
|
On b-coloring of Kneser graphs
|
- |
|
On the 1-2-3-conjecture
|
- |
|
Characterization of a Class of Hamiltonian Connected Graphs
|
- |
|
A characterization of some graphs with metric dimension two
|
- |
|
On the locating chromatic number of Kneser graphs
|
- |