|
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
|
- |
|
On the total restrained domination edge critical graphs
|
- |
|
On the Defining Numbers of Cartesian Product of Cycles
|
- |
|
Chromatic equivalence classes of certain generalized polygon trees III
|
- |
|
Bike Share Station Location using Graph Domination Set in Graphs
|
- |
|
Critical Hamiltonian connected graphs
|
- |
|
Local Chromatic Number of Graphs
|
- |
|
Fostering Peer Learning with a Game-Theoretical Approach in a Blended Learning Environment
|
- |
|
On the defining sets of some special graphs
|
- |
|
Complexity reduction of throughput optimal link scheduling algorithm through topology control in wireless networks
|
- |
|
On the locating chromatic number of the cartesian product of graphs
|
- |
|
On the Dominating Coloring
|
- |
|
Star edge coloring of the Cartesian product of graphs
|
- |
|
Local coloring of the Kneser graphs
|
- |
|
An optimal traffic distribution method supporting end-to-end delay bound
|
- |