scientific article; zbMATH DE number 5284085

MaRDI QIDQ3501345zbMATH OpenFDO

Authors Damei Lü, Wensong Lin, Zengmin Song

Publication date 3 June 2008

zbMATH Keywords

connectivitypath covering number\(L (2,1)\)-labelings

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2073985
• The \(L(2,1)\)-labelings on a class of connected full colorable graphs
• scientific article; zbMATH DE number 5583498
• \(L(2,1)\)-labeling of graphs: known results and open problems
• \(L(2,1)\)-labelings on the composition of \(n\) graphs
• \(L (2,1,1)\)-labeling of simple graphs
• The \(L(2,1)\)-\({\mathcal F}\)-labeling problem of graphs
• \(L(3,2,1)\)-labeling of graphs
• scientific article; zbMATH DE number 5812224
• \(L(3,2,1)\)-labelling of graphs

Cited in

(6)

• scientific article; zbMATH DE number 1472166 (Why is no real title available?)
• Relating path coverings to vertex labellings with a condition at distance two
• Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers
• scientific article; zbMATH DE number 749300 (Why is no real title available?)
• scientific article; zbMATH DE number 5583498 (Why is no real title available?)
• Path covering number and \(L(2,1)\)-labeling number of graphs

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 Q3501345)