The \(L(h,1,1)\)-labelling problem for trees
From MaRDI portal
Publication:976152
DOI10.1016/j.ejc.2009.11.006zbMath1215.05151OpenAlexW1993745025MaRDI QIDQ976152
Charl J. Ras, Sanming Zhou, Deborah M. King
Publication date: 17 June 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2009.11.006
Related Items (8)
Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees ⋮ \(L(3,2,1)\)-labeling of triangular and toroidal grids ⋮ Distance three labelings of trees ⋮ Distance labellings of Cayley graphs of semigroups ⋮ Unnamed Item ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span ⋮ Linear and cyclic distance-three labellings of trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
- A distance-labelling problem for hypercubes
- Distance-two labellings of Hamming graphs
- Labeling trees with a condition at distance two.
- On \(L(d,1)\)-labelings of graphs
- A coloring problem on the \(n\)-cube
- New bounds on a hypercube coloring problem.
- A channel assignment problem for optical networks modelled by Cayley graphs
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
- Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
- L(h,1,1)-Labeling of Outerplanar Graphs
- Labelling Graphs with a Condition at Distance 2
- The $L(2,1)$-Labeling Problem on Graphs
- Coloring Powers of Chordal Graphs
- Labelling Cayley Graphs on Abelian Groups
- Automata, Languages and Programming
- Labeling trees with a condition at distance two
- Fixed-parameter complexity of \(\lambda\)-labelings
This page was built for publication: The \(L(h,1,1)\)-labelling problem for trees
