L(d,1)-labeling of regular tilings

zbMATH Open1100.05082MaRDI QIDQ5486909FDOQ5486909

Benqiu Dai, Zengmin Song

Publication date: 15 September 2006

zbMATH Keywords

vertex labelingfrequency assignment problem

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

   Recommendations

• \(L(h,1)\)-labeling subclasses of planar graphs 👍 👎
• The \(L(d_1,d_2)\)-labeling problem on graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Optimal \(L(h,k)\)-labeling of regular grids 👍 👎
• \(L(3,2,1)\)-labeling of triangular and toroidal grids 👍 👎

This page was built for publication: \(L(d,1)\)-labeling of regular tilings

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