On theL(2, 1)-labelling of block graphs

DOI10.1080/00207161003650075zbMath1226.05211OpenAlexW2053535571MaRDI QIDQ5391500

Márcia R. Cerioli, Flavia Bonomo-Braberman

Publication date: 6 April 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

frequency assignment problem

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

\(L(2,1)\)-labeling of interval graphs ⋮ \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs ⋮ On circular-L(2, 1)-labellings of products of graphs

Cites Work

• Unnamed Item
• On \(L(d,1)\)-labelings of graphs
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• Distance-two labelings of graphs
• On the \(L(p,1)\)-labelling of graphs
• Full Color Theorems for L(2,1)-Colorings
• Labelling Graphs with a Condition at Distance 2
• A Theorem about the Channel Assignment Problem
• On Regular Graphs Optimally Labeled with a Condition at Distance Two
• The $L(2,1)$-Labeling Problem on Graphs

This page was built for publication: On theL(2, 1)-labelling of block graphs