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

zbMATH Open1084.05062MaRDI QIDQ3370938FDOQ3370938

Authors: Zhendong Shao 

Publication date: 21 February 2006

Recommendations

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

zbMATH Keywords

Halin graphsKneser graphsirregular graphs

Mathematics Subject Classification ID

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

Cited In (23)

• Title not available (Why is that?)
• The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(L(h,k)\)-labelings of Hamming graphs
• \(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 \(L(h,k)\)-labeling index of inverse graphs associated with finite cyclic groups
• \(k\)-number of complete muti-partite graphs
• One point union of paths of cycles and their \(k\)-numbers
• \(L(2,1)\)-labeling of flower snark and related graphs.
• \(L(p,q)\)-labeling of fullerene graphs
• Title not available (Why is that?)
• \(L(2,1)\)-labeling of graphs: known results and open problems
• The \(L(3,2,1)\)-labeling problem on graphs
• \(L(3, 2, 1)\)-labeling of banana trees
• The \(L (2, 1)\)-labeling number of two special graphs
• Optimal \(L(3, 2, 1)\)-labeling of triangular lattice
• \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs
• Title not available (Why is that?)
• $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 Q3370938)