\(L(j,k)\)-labelling and maximum ordering-degrees for trees
From MaRDI portal
Publication:968198
DOI10.1016/J.DAM.2009.11.018zbMath1225.05082OpenAlexW2000225603MaRDI QIDQ968198
Daphne Der-Fen Liu, Li-Yueh Chen, Justie Su-Tzu Juan
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.11.018
Related Items (2)
The \((p,q)\)-total labeling problem for trees ⋮ \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Labeling trees with a condition at distance two.
- On \(L(d,1)\)-labelings of graphs
- Distance-two labelings of graphs
- \(L(h,1)\)-labeling subclasses of planar graphs
- A bound on the chromatic number of the square of a planar graph
- A survey on labeling graphs with a condition at distance two
- Pair Labellings with Given Distance
- Real Number Channel Assignments for Lattices
- Real Number Graph Labellings with Distance Conditions
- Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
- Labelling Graphs with a Condition at Distance 2
- Labeling Chordal Graphs: Distance Two Condition
- Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- The $L(2,1)$-Labeling Problem on Graphs
This page was built for publication: \(L(j,k)\)-labelling and maximum ordering-degrees for trees
