The L(h,1,1)-labelling problem for trees

DOI10.1016/J.EJC.2009.11.006zbMATH Open1215.05151OpenAlexW1993745025MaRDI QIDQ976152FDOQ976152

C. 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

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Labelling Graphs with a Condition at Distance 2
• A distance-labelling problem for hypercubes
• The $L(2,1)$-Labeling Problem on Graphs
• A coloring problem on the \(n\)-cube
• New bounds on a hypercube coloring problem.
• Title not available (Why is that?)
• Fixed-parameter complexity of \(\lambda\)-labelings
• On \(L(d,1)\)-labelings of graphs
• Title not available (Why is that?)
• Labeling trees with a condition at distance two.
• L(h,1,1)-Labeling of Outerplanar Graphs
• Automata, Languages and Programming
• Labeling trees with a condition at distance two
• Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
• Distance-two labellings of Hamming graphs
• A channel assignment problem for optical networks modelled by Cayley graphs
• Labelling Cayley Graphs on Abelian Groups
• No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
• Coloring Powers of Chordal Graphs
• Title not available (Why is that?)
• Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
• Title not available (Why is that?)

Cited In (18)

• Distance three labelings of trees
• Title not available (Why is that?)
• On the complexity of labeled oriented trees
• On cordial labeling of hypertrees
• A note on \(L (2, 1)\)-labelling of trees
• Distance-constrained labellings of Cartesian products of graphs
• Title not available (Why is that?)
• \(L(3,2,1)\)-labeling of triangular and toroidal grids
• An asymptotic analysis of labeled and unlabeled \(k\)-trees
• Linear and cyclic distance-three labellings of trees
• The \((p,q)\)-total labeling problem for trees
• Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees
• On \(\alpha\)-labellings of lobsters and trees with a perfect matching
• On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span
• Distance labellings of Cayley graphs of semigroups
• A characterization of L(2, 1)-labeling number for trees with maximum degree 3
• The (p,q)-total Labeling Problem for Trees
• A theorem on labelled trees and the limits of its provability

   Recommendations

• Title not available (Why is that?) 👍 👎
• Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees 👍 👎
• The \(L(2,1)\)-labelling of trees 👍 👎
• The \((p,q)\)-total labeling problem for trees 👍 👎
• The (p,q)-total Labeling Problem for Trees 👍 👎
• Title not available (Why is that?) 👍 👎
• A note on \(L (2, 1)\)-labelling of trees 👍 👎
• An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees 👍 👎
• \(L(2,1,1)\)-labeling is NP-complete for trees 👍 👎
• An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees 👍 👎

This page was built for publication: The \(L(h,1,1)\)-labelling problem for trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976152)