Distance-two labellings of Hamming graphs
type: Item
instance of: scholarly article
title: Distance-two labellings of Hamming graphs
zbMATH Open document ID: 1213.05231
author: Sanming Zhou
author: Gerard Jennhwa Chang
author: Changhong Lu
published in: Discrete Applied Mathematics
publication date: 2009-06-24T00:00:00Z
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 5569476
zbMATH Keywords: channel assignment
zbMATH Keywords: \(L(j, k)\)-labelling
zbMATH Keywords: cyclic \(L(j, k)\)-labelling
zbMATH Keywords: no-hole \(L(j, k)\)-labelling
zbMATH Keywords: no-hole cyclic \(L(j, k)\)-labelling
zbMATH Keywords: \(\lambda \)-number
zbMATH Keywords: Hamming graph
MaRDI profile type: Publication
full work available at URL: j.dam.2009.01.001
OpenAlex ID: W1985079310
cites work: Minimum span of no-hole \((r+1)\)-distant colorings
cites work: Q5461468
cites work: The $L(2,1)$-Labeling Problem on Graphs
cites work: Distance-two labelings of graphs
cites work: No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
cites work: Q4949819
cites work: Q3838194
cites work: Labeling products of complete graphs with a condition at distance two
cites work: Relating path coverings to vertex labellings with a condition at distance two
cites work: Labelling Graphs with a Condition at Distance 2
cites work: Hamiltonicity and circular distance two labellings
cites work: Q4949774
cites work: \(T\)-colorings of graphs: recent results and open problems
cites work: No-hole 2-distant colorings
cites work: Labeling Chordal Graphs: Distance Two Condition
cites work: No-hole \((r+1)\)-distant colorings
cites work: \(L(2,1)\)-labelings of Cartesian products of two cycles
cites work: No-hole \(k\)-tuple \((r+1)\)-distant colorings
cites work: Q4865135
cites work: Graph labeling and radio channel assignment
cites work: Labelling Cayley Graphs on Abelian Groups
cites work: Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
cites work: Bounding the bandwidths for graphs
DOI: 10.1016/J.DAM.2009.01.001
description: scientific article; zbMATH DE number 5569476