L(2, 1)-Coloring Matrogenic Graphs
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Distance-two labelings of graphs
European Journal of Combinatorics
Labeling trees with a condition at distance two
Discrete Mathematics
The Chromatic Number of Graph Powers
Combinatorics, Probability and Computing
A note on collections of graphs with non-surjective lambda labelings
Discrete Applied Mathematics
List version of L(d, s)-labelings
Theoretical Computer Science - Graph colorings
The L(2, 1)-labelling of trees
Discrete Applied Mathematics
L(2, 1)-labelings of Cartesian products of two cycles
Discrete Applied Mathematics
Distance-two labelings of digraphs
Discrete Applied Mathematics
Labeling planar graphs with a condition at distance two
European Journal of Combinatorics
(2,1)-Total labelling of outerplanar graphs
Discrete Applied Mathematics
New bounds for the L(h, k) number of regular grids
International Journal of Mobile Network Design and Innovation
Optimal frequency assignments of cycles and powers of cycles
International Journal of Mobile Network Design and Innovation
Bounds for the L(d, 1): number of diameter 2 graphs, trees and cacti
International Journal of Mobile Network Design and Innovation
Note: Improved upper bounds on the L(2,1) -labeling of the skew and converse skew product graphs
Theoretical Computer Science
Labelling planar graphs without 4-cycles with a condition on distance two
Discrete Applied Mathematics
An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
On L(d,1)-labeling of Cartesian product of a cycle and a path
Discrete Applied Mathematics
Injective coloring of planar graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
Distance constrained labelings of planar graphs with no short cycles
Discrete Applied Mathematics
Graph labellings with variable weights, a survey
Discrete Applied Mathematics
An O(n1.75) algorithm for L(2,1)-labeling of trees
Theoretical Computer Science
Notes: A note on collections of graphs with non-surjective lambda labelings
Discrete Applied Mathematics
Note: The L(2,1)-labelling of trees
Discrete Applied Mathematics
L(2,1)-labelings of Cartesian products of two cycles
Discrete Applied Mathematics
L(j,k)-labelling and maximum ordering-degrees for trees
Discrete Applied Mathematics
Distance constrained labelings of trees
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
The L(h,1,1)-labelling problem for trees
European Journal of Combinatorics
Note: L(2,1)-Labelings on the composition of n graphs
Theoretical Computer Science
Unitarity plus causality implies localizability
Journal of Computer and System Sciences
Group path covering and distance two labeling of graphs
Information Processing Letters
Group path covering and L(j,k)-labelings of diameter two graphs
Information Processing Letters
L(2, 1, 1)-labeling is NP-complete for trees
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Distance three labelings of trees
Discrete Applied Mathematics
On n-fold L(j,k)-and circular L(j,k)-labelings of graphs
Discrete Applied Mathematics
List backbone colouring of graphs
Discrete Applied Mathematics
| Hi-index | 0.06 |