The L(2,1)-labelling of trees

DOI10.1016/J.DAM.2005.09.007zbMATH Open1088.05066OpenAlexW2160384837MaRDI QIDQ2489954FDOQ2489954

Authors: Weifan Wang 

Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.09.007

Recommendations

• A note on \(L (2, 1)\)-labelling of trees
• The \(L(h,1,1)\)-labelling problem for trees
• A characterization of L(2, 1)-labeling number for trees with maximum degree 3
• Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees
• A complete \(L (2, 1)\) span characterization for small trees

zbMATH Keywords

DistanceMaximum degree

Mathematics Subject Classification ID

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

Cites Work

• Relating path coverings to vertex labellings with a condition at distance two
• Labelling Graphs with a Condition at Distance 2
• A bound on the chromatic number of the square of a planar graph
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph
• The $L(2,1)$-Labeling Problem on Graphs
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• Labeling products of complete graphs with a condition at distance two
• On \(L(d,1)\)-labelings of graphs
• Labeling Chordal Graphs: Distance Two Condition
• A Theorem about the Channel Assignment Problem

Cited In (54)

• Optimal radiocoloring of trees
• \(\lambda\)-number of banana trees
• \(L(s, t)\) edge spans of trees and product of two paths
• The \(L (d,1)\)-\(T\) labeling on claw-free graphs and splitted graphs
• Some classes of trees with maximum number of holes two
• Title not available (Why is that?)
• Convex labelings of trees
• \(L(p,q)\)-labeling and integer tension of a graph embedded on torus
• New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
• Labeling trees with a condition at distance two
• Title not available (Why is that?)
• On cordial labeling of hypertrees
• Solutions of some \(L(2, 1)\)-coloring related open problems
• Bounds on the convex label number of trees
• Infinitely many trees with maximum number of holes zero, one, and two
• (2,1)-total labelling of trees with sparse vertices of maximum degree
• A note on \(L (2, 1)\)-labelling of trees
• The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs
• Distinguished trees, double-trees and lifting theorems
• Labeling trees with a condition at distance two.
• \(L(1,2)\)-labeling for square graph of some trees
• \(L(j,k)\)-labelling and maximum ordering-degrees for trees
• \((2,1)\)-Total number of trees with maximum degree three
• \(\alpha\)-labeling number of trees
• A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable
• An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
• A linear time algorithm for \(L(2,1)\)-labeling of trees
• Distance two labeling on the square of a cycle
• Title not available (Why is that?)
• A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)
• Title not available (Why is that?)
• On \((s,t)\)-relaxed \(L(1,1)\)-labelling of trees
• An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
• The list \(L(2,1)\)-labeling of planar graphs with large girth
• The List \(L(2, 1)\)-labeling of planar graphs
• The \((p,q)\)-total labeling problem for trees
• The \(L(h,1,1)\)-labelling problem for trees
• Labelling planar graphs without 4-cycles with a condition on distance two
• \((2,1)\)-total labeling of trees with large maximum degree
• Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees
• The \(L(d,1)\)-number of powers of paths
• On \(\alpha\)-labellings of lobsters and trees with a perfect matching
• A complete \(L (2, 1)\) span characterization for small trees
• Characterization of unlabeled level planar trees
• Some results on distance two labelling of outerplanar graphs
• A characterization of L(2, 1)-labeling number for trees with maximum degree 3
• The (p,q)-total Labeling Problem for Trees
• Labelled and unlabelled enumeration of \(k\)-gonal 2-trees
• A theorem on labelled trees and the limits of its provability
• Labelled trees and factorizations of a cycle into transpositions
• Optimal frequency assignment and planar list \(L(2, 1)\)-labeling
• Title not available (Why is that?)
• On backbone coloring of graphs
• \((2,1)\)-total labelling of outerplanar graphs

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

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