|
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
|
- |
|
On the oriented perfect path double cover conjecture
|
- |
|
Randomly Dimensional Graphs
|
- |
|
Clique-coloring of K3, 3-minor free graphs
|
- |
|
The metric dimension of the lexicographic product of graphs
|
- |
|
Star coloring and tree-width of Kneser graph KG(n; 2)
|
- |
|
Some Graphs with Vertex-Coloring 2-Edge Weighting
|
- |
|
Set Intersection Representations of Graphs
|
- |
|
The impact of network topology on delay bound in wireless Ad Hoc networks
|
- |
|
Chromaticity of Generalised Polygon Trees
|
- |
|
Chromatic equivalence classes of certain cycles with edges
|
- |
|
Bounds on Some Variants of Clique Cover Numbers
|
- |