The L(3,2,1)-labeling problem on graphs

MaRDI QIDQ3540508zbMATHFDO

Authors Zhendong Shao, Jiazhuang Liu

Publication date 24 November 2008

zbMATH Keywords

\(L(3,2,1)\)-labeling3-chromatic numbervertex 3-coloring

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2145257
• \(L(3,2,1)\)-labeling of graphs
• The \(L(d_1,d_2)\)-labeling problem on graphs
• The \(L (3, 2, 1)\)-labeling problem on graphs
• \(L(3,2,1)\)-labelling of graphs

Cited in

(33)

• \(L(2,1)\)-labeling of graphs: known results and open problems
• Optimal \(L(3, 2, 1)\)-labeling of triangular lattice
• scientific article; zbMATH DE number 7710903 (Why is no real title available?)
• The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
• Distance two surjective labelling of paths and interval graphs
• \(L(p,2,1)\)-labeling of the infinite regular trees
• \(L(3,2,1)\)-labelling of graphs
• $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
• \(L(3,2,1)\)-labeling problems on trapezoid graphs
• The \(L (3, 2, 1)\)-labeling problem on graphs
• Frequency assignment problem in networks with limited spectrum
• scientific article; zbMATH DE number 7009474 (Why is no real title available?)
• \(L(3, 2, 1)\)-labeling problem of square of path
• \(L(3, 2, 1)\)-labeling of certain planar graphs
• The \(L (3,2,1)\)-labeling of Goldberg snark graphs
• \(k\)-number of complete muti-partite graphs
• scientific article; zbMATH DE number 2145257 (Why is no real title available?)
• The \(L(d_1,d_2)\)-labeling problem on graphs
• On the \(L(p,1)\)-labelling of graphs
• \(L(3,2,1)\)-labeling for cylindrical grid: the Cartesian product of a path and a cycle
• \(K_n\square P\) is radio graceful
• \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
• One point union of paths of cycles and their \(k\)-numbers
• \(L(3,2,1)\)-labeling of triangular and toroidal grids
• \(L(3, 2, 1)\)-labeling of banana trees
• L(2,1,1)-labeling of interval graphs
• Distance-constrained labeling of complete trees
• Is there any polynomial upper bound for the universal labeling of graphs?
• \(L(3,2,1)\)-labeling of graphs
• scientific article; zbMATH DE number 7295442 (Why is no real title available?)
• The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures
• \(L(2,1)\)-labeling of oriented planar graphs
• \(L (2,1,1)\)-labeling of simple graphs

This page was built for publication: The \(L(3,2,1)\)-labeling problem on graphs

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