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

zbMATH Open1172.05320MaRDI QIDQ3540508FDOQ3540508

Authors: Zhendong Shao, Jiazhuang Liu 

Publication date: 24 November 2008

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

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)

Cited In (33)

• \(L(p,2,1)\)-labeling of the infinite regular trees
• Distance-constrained labeling of complete trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(K_n\square P\) is radio graceful
• Is there any polynomial upper bound for the universal labeling of graphs?
• \(L(3,2,1)\)-labeling problems on trapezoid graphs
• \(L (2,1,1)\)-labeling of simple graphs
• Title not available (Why is that?)
• The \(L(d_1,d_2)\)-labeling problem on graphs
• \(L(3,2,1)\)-labeling of triangular and toroidal grids
• \(L(3,2,1)\)-labeling of graphs
• The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
• The \(L (3,2,1)\)-labeling of Goldberg snark graphs
• On the \(L(p,1)\)-labelling of graphs
• Distance two surjective labelling of paths and interval graphs
• Title not available (Why is that?)
• \(L(2,1)\)-labeling of graphs: known results and open problems
• Frequency assignment problem in networks with limited spectrum
• \(L(3,2,1)\)-labelling of graphs
• \(L(3, 2, 1)\)-labeling of certain planar graphs
• \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
• The \(L (3, 2, 1)\)-labeling problem on graphs
• \(L(3,2,1)\)-labeling for cylindrical grid: the Cartesian product of a path and a cycle
• \(L(3, 2, 1)\)-labeling of banana trees
• \(L(2,1)\)-labeling of oriented planar graphs
• L(2,1,1)-labeling of interval graphs
• Optimal \(L(3, 2, 1)\)-labeling of triangular lattice
• \(L(3, 2, 1)\)-labeling problem of square of path
• $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
• The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures

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)