scientific article; zbMATH DE number 2145257

zbMATH Open1067.05069MaRDI QIDQ4657607FDOQ4657607

Authors: Zhendong Shao 

Publication date: 14 March 2005

Title of this publication is not available (Why is that?)

Recommendations

• \(L(3,2,1)\)-labeling of graphs
• \(L(3,2,1)\)-labelling of graphs
• The \(L(3,2,1)\)-labeling problem on graphs
• The \(L (3, 2, 1)\)-labeling problem on graphs
• On \(L(d,1)\)-labelings of graphs
• scientific article; zbMATH DE number 5812224
• scientific article; zbMATH DE number 7009474
• The \(L(d_1,d_2)\)-labeling problem on graphs
• The \(L(3,2,1)\)-labeling on bipartite graphs
• \(L(3,1)\)-labeling of circulant graphs

zbMATH Keywords

\(L(2,\,1)\)-labelingvertex 3-coloring\(3\)-chromatic number

Mathematics Subject Classification ID

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

Cited In (36)

• The \(L(2,1)\)-labeling of certain generalized Petersen graphs
• Distance-constrained labeling of complete trees
• Title not available (Why is that?)
• On the \(L(2, 1)\)-labelling of block graphs
• The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
• On \(L(2,1)\)-labeling of generalized Petersen graphs
• Title not available (Why is that?)
• On \(L(d,1)\)-labelings of graphs
• Title not available (Why is that?)
• \(L(3,2,1)\)-labeling problems on trapezoid graphs
• Pair \(L(2, 1)\)-labelings of infinite graphs
• Title not available (Why is that?)
• The \(L(d_1,d_2)\)-labeling problem on graphs
• Labeling graphs with two distance constraints
• The \(L(2,1)\)-\({\mathcal F}\)-labeling problem of graphs
• \(L (d,1)\)-labelings of the Möbius ladders
• \(L(3,2,1)\)-labeling of graphs
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• Frequency assignment through combinatorial optimization approach
• The game \(L(d,1)\)-labeling problem of graphs
• Group path covering and distance two labeling of graphs
• \(L(2,1)\)-labeling of flower snark and related graphs.
• A distance-labelling problem for hypercubes
• The \(L(d,1)\)-number of powers of paths
• \(L(2,1)\)-labeling of graphs: known results and open problems
• \(L(3,2,1)\)-labelling of graphs
• The \(L(3,2,1)\)-labeling problem on graphs
• A survey on labeling graphs with a condition at distance two
• The \(L (3, 2, 1)\)-labeling problem on graphs
• Edge span of \(L(d,1)\)-labeling on some graphs
• \(L(d,1)\)-labeling of regular tilings
• \(L(p,q)\) labeling of \(d\)-dimensional grids
• Upper bound of \(L\binom{0,1,2}{d,d,1}\)-labeling number of a class of fissile graphs
• 3-equitable labelings of ladders and graphs related to cycles
• Title not available (Why is that?)
• List version of \(L(d,s)\)-labelings

This page was built for publication:

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