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

DOI10.1016/J.EJC.2009.11.006MaRDI QIDQ976152zbMATHOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 7295442
• 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
• scientific article; zbMATH DE number 2197903
• 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

Cites work

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

Cited in

(25)

• Distance-constrained labellings of Cartesian products of graphs
• The \(L (d,1)\)-\(T\) labeling on claw-free graphs and splitted graphs
• Linear and cyclic distance-three labellings of trees
• Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees
• A tree labeling problem
• scientific article; zbMATH DE number 7688018 (Why is no real title available?)
• The tree profile problem and optimal edge labeling.
• Distance labellings of Cayley graphs of semigroups
• The \((p,q)\)-total labeling problem for trees
• On \(\alpha\)-labellings of lobsters and trees with a perfect matching
• Distance three labelings of trees
• \(L(3,2,1)\)-labeling of triangular and toroidal grids
• Labeling trees with a condition at distance two
• A theorem on labelled trees and the limits of its provability
• An asymptotic analysis of labeled and unlabeled \(k\)-trees
• On the complexity of labeled oriented trees
• The (p,q)-total Labeling Problem for Trees
• Bounds on the convex label number of trees
• scientific article; zbMATH DE number 7295442 (Why is no real title available?)
• On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span
• A characterization of L(2, 1)-labeling number for trees with maximum degree 3
• On \((s,t)\)-relaxed \(L(1,1)\)-labelling of trees
• The \(L(2,1)\)-labelling of trees
• A note on \(L (2, 1)\)-labelling of trees
• On cordial labeling of hypertrees

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)