Multiple \(L(j,1)\)-labeling of the triangular lattice
type: Item
instance of: scholarly article
title: Multiple \(L(j,1)\)-labeling of the triangular lattice
zbMATH Open document ID: 1322.90107
author: Pu Zhang
author: Wensong Lin
published in: Journal of Combinatorial Optimization
publication date: 2014-06-24T00:00:00Z
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6307084
zbMATH Keywords: \(L(j,k)\)-labeling number
zbMATH Keywords: circular \(L(j,k)\)-labeling number
zbMATH Keywords: \(n\)-fold \(L(j,k)\)-labeling number
zbMATH Keywords: \(n\)-fold circular \(L(j,k)\)-labeling number
zbMATH Keywords: triangular~lattice
MaRDI profile type: Publication
full work available at URL: s10878-012-9549-9
OpenAlex ID: W1963603129
cites work: Q5387672
cites work: Two Results Concerning Multicoloring
cites work: Labelling Graphs with a Condition at Distance 2
cites work: Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
cites work: Graph labeling and radio channel assignment
cites work: Multichromatic numbers, star chromatic numbers and Kneser graphs
cites work: Cyclic labellings with constraints at two distances
cites work: Q3572431
cites work: \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
cites work: Multicoloring and Mycielski construction
cites work: On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
cites work: Multi-coloring the Mycielskian of graphs
cites work: Hamiltonicity and circular distance two labellings
cites work: Q5466031
cites work: n-tuple colorings and associated graphs
cites work: Labelling graphs with the circular difference
cites work: A survey on labeling graphs with a condition at distance two
DOI: 10.1007/S10878-012-9549-9
description: scientific article; zbMATH DE number 6307084