L(2, 1)-labeling of strong products of cycles

Authors:
Danilo Korže;Aleksander Vesel
Affiliations:
Department of Computer Science, FERI, University of Maribor, Smetanova 17, SI-2000 Maribor, Slovenia;Department of Mathematics and Computer Science, PEF, University of Maribor, Koroška cesta 160, SI-2000 Maribor, Slovenia
Venue:
Information Processing Letters
Year:
2005

Citing 7
Cited 1

A randomised 3-colouring algorithm

Discrete Mathematics - Graph colouring and variations
Labelling graphs with a condition at distance 2

SIAM Journal on Discrete Mathematics
Data structures and algorithm analysis (2nd ed.)

Data structures and algorithm analysis (2nd ed.)
Relating path coverings to vertex labellings with a condition at distance two

Discrete Mathematics
Analysis of the mean field annealing algorithm for graph colouring

Journal of Artificial Neural Networks - Special issue: neural networks for optimization
Channel Assignment with Separation for Interference Avoidance in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers

Discrete Applied Mathematics

New bounds for the L(h, k) number of regular grids

International Journal of Mobile Network Design and Innovation

Quantified Score

Hi-index	0.89

Visualization

Abstract