|
Some lower bounds for the L-intersection number of graphs
|
- |
|
Bike Share Station Location using Graph Domination Set in Graphs
|
- |
|
Complexity reduction of throughput optimal link scheduling algorithm through topology control in wireless networks
|
- |
|
Pairwise balanced designs and sigma clique partitions
|
- |
|
An optimal traffic distribution method supporting end-to-end delay bound
|
- |
|
Local clique covering of claw-free graphs
|
- |
|
On the 1-2-3-conjecture
|
- |
|
On the simultaneous edge coloring of graphs
|
- |
|
Small oriented cycle double cover of graphs
|
- |
|
On the oriented perfect path double cover conjecture
|
- |
|
Star coloring and tree-width of Kneser graph KG(n; 2)
|
- |
|
On the Total Restrained Domination Number
|
- |
|
Chromaticity of Generalised Polygon Trees
|
- |
|
On the Defining Numbers of Cartesian Product of Cycles
|
- |
|
Local Chromatic Number of Graphs
|
- |
|
On the Dominating Coloring
|
- |
|
A New Bound for Defining Numbers of Regular Graphs
|
- |
|
Chromatic Classes of Certain 2-Connected Graphs
|
- |
|
Distance Locating Sets in Graphs
|
- |
|
On the b-Coloring of Some Special Graphs
|
- |