A complete \(L (2, 1)\) span characterization for small trees

DOI10.1016/J.AKCEJ.2015.06.004zbMath1332.05125OpenAlexW2198873357MaRDI QIDQ896092

Jobby Jacob, Christopher A. Wood

Publication date: 11 December 2015

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2015.06.004

zbMATH Keywords

channel assignment problem\(L (2, 1)\) labelingChang-Kuo algorithmforbidden subtree characterization

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Infinitely many trees with maximum number of holes zero, one, and two ⋮ Some classes of trees with maximum number of holes two

Uses Software

• Unnamed Item

Cites Work

• A linear time algorithm for \(L(2,1)\)-labeling of trees
• Labelling Graphs with a Condition at Distance 2
• The $L(2,1)$-Labeling Problem on Graphs

This page was built for publication: A complete \(L (2, 1)\) span characterization for small trees