The \(L(2,1)\)-labelling of trees
From MaRDI portal
Publication:2489954
DOI10.1016/j.dam.2005.09.007zbMath1088.05066OpenAlexW2160384837MaRDI QIDQ2489954
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
Related Items (27)
A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) ⋮ Solutions of some \(L(2, 1)\)-coloring related open problems ⋮ OPTIMAL RADIOCOLORING OF TREES ⋮ Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees ⋮ An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees ⋮ A linear time algorithm for \(L(2,1)\)-labeling of trees ⋮ The List \(L(2, 1)\)-labeling of planar graphs ⋮ An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees ⋮ On backbone coloring of graphs ⋮ Unnamed Item ⋮ \((2,1)\)-total labelling of outerplanar graphs ⋮ Infinitely many trees with maximum number of holes zero, one, and two ⋮ Labelling planar graphs without 4-cycles with a condition on distance two ⋮ Some classes of trees with maximum number of holes two ⋮ A note on \(L (2, 1)\)-labelling of trees ⋮ New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs ⋮ The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs ⋮ (2,1)-total labelling of trees with sparse vertices of maximum degree ⋮ \((2,1)\)-Total number of trees with maximum degree three ⋮ \(L(p,q)\)-labeling and integer tension of a graph embedded on torus ⋮ A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable ⋮ The list \(L(2,1)\)-labeling of planar graphs with large girth ⋮ DISTANCE TWO LABELING ON THE SQUARE OF A CYCLE ⋮ The \(L(d,1)\)-number of powers of paths ⋮ Some results on distance two labelling of outerplanar graphs ⋮ Optimal frequency assignment and planar list \(L(2, 1)\)-labeling ⋮ \((2,1)\)-total labeling of trees with large maximum degree
Cites Work
- Relating path coverings to vertex labellings with a condition at distance two
- On \(L(d,1)\)-labelings of graphs
- A bound on the chromatic number of the square of a planar graph
- Labeling Products of Complete Graphs with a Condition at Distance Two
- Labelling Graphs with a Condition at Distance 2
- Labeling Chordal Graphs: Distance Two Condition
- A Theorem about the Channel Assignment Problem
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- Coloring the square of a planar graph
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- The $L(2,1)$-Labeling Problem on Graphs
This page was built for publication: The \(L(2,1)\)-labelling of trees
