Optimal L (3,2,1)-labeling of trees

DOI10.1080/09728600.2024.2358691MaRDI QIDQ7028148zbMATH OpenFDO

Authors Xiaoling Zhang

Publication date 12 February 2025

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1080/09728600.2024.2358691

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• \(L(3, 2, 1)\)-labeling of banana trees
• L(3,2,1)-labeling of graphs
• A survey on labeling graphs with a condition at distance two
• scientific article; zbMATH DE number 7295442 (Why is no real title available?)
• Labelling Graphs with a Condition at Distance 2
• The $L(2,1)$-Labeling Problem on Graphs
• The L (3, 2, 1)-labeling problem on graphs
• The L(2,1)-labelling of trees
• The L(3,2,1)-labeling problem on graphs

This page was built for publication: Optimal L (3,2,1)-labeling of trees

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