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

DOI10.1016/J.AKCEJ.2015.06.004zbMATH Open1332.05125OpenAlexW2198873357MaRDI QIDQ896092FDOQ896092

Authors: Christopher A. Wood, Jobby Jacob 

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

Recommendations

• The \(L(2,1)\)-labelling of trees
• Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees
• A characterization of L(2, 1)-labeling number for trees with maximum degree 3
• An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
• Labeling trees with a condition at distance two

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)

Cites Work

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

Cited In (8)

• \(L(s, t)\) edge spans of trees and product of two paths
• Some classes of trees with maximum number of holes two
• Labeling trees with a condition at distance two
• Infinitely many trees with maximum number of holes zero, one, and two
• A class of full \((d,1)\)-colorable trees
• The \(L(2,1)\)-labelling of trees
• Full Color Theorems for L(2,1)-Colorings
• Title not available (Why is that?)

Uses Software

• nauty

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

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