The \(L(h,1,1)\)-labelling problem for trees
type: Item
instance of: scholarly article
title: The \(L(h,1,1)\)-labelling problem for trees
zbMATH Open document ID: 1215.05151
author: C. J. Ras
author: Sanming Zhou
author: Deborah M. King
published in: European Journal of Combinatorics
publication date: 2010-06-17T00:00:00Z
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5722038
MaRDI profile type: MaRDI publication profile
full work available at URL: j.ejc.2009.11.006
OpenAlex ID: W1993745025
cites work: Q3041243
cites work: L(h,1,1)-Labeling of Outerplanar Graphs
cites work: Labeling trees with a condition at distance two
cites work: On \(L(d,1)\)-labelings of graphs
cites work: The $L(2,1)$-Labeling Problem on Graphs
cites work: No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
cites work: Distance-two labellings of Hamming graphs
cites work: Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
cites work: Automata, Languages and Programming
cites work: Fixed-parameter complexity of \(\lambda\)-labelings
cites work: Q4448371
cites work: Q3838194
cites work: Labeling trees with a condition at distance two.
cites work: Labelling Graphs with a Condition at Distance 2
cites work: A coloring problem on the \(n\)-cube
cites work: Coloring Powers of Chordal Graphs
cites work: New bounds on a hypercube coloring problem.
cites work: Labelling Cayley Graphs on Abelian Groups
cites work: A channel assignment problem for optical networks modelled by Cayley graphs
cites work: Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
cites work: A distance-labelling problem for hypercubes
cites work: Q4283631
DOI: 10.1016/J.EJC.2009.11.006
Recommended article: Q3385950
Recommended article: Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees
Recommended article: The \(L(2,1)\)-labelling of trees
Recommended article: The \((p,q)\)-total labeling problem for trees
Recommended article: The (p,q)-total Labeling Problem for Trees
Recommended article: Q5466046
Recommended article: A note on \(L (2, 1)\)-labelling of trees
Recommended article: An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
Recommended article: L(2,1,1)-Labeling Is NP-Complete for Trees
Recommended article: An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
description: scientific article; zbMATH DE number 5722038