The L(2,1)-labelings on a class of connected full colorable graphs

MaRDI QIDQ3171038zbMATHFDO

Authors Xiao-Ling Zhao, Changhong Lu

Publication date 29 September 2011

zbMATH Keywords

channel assignment problem\(L(2,1)\)-labelinggeneral Mycielski graphfull colorable graph

Mathematics Subject Classification ID

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

Recommendations

• Labeling Mycielski graphs with a condition at distance two.
• scientific article; zbMATH DE number 2220954
• scientific article; zbMATH DE number 2091962
• An extremal problem on non-full colorable graphs
• Full Color Theorems for L(2,1)-Colorings

Cited in

(10)

• \(F\)-WORM colorings: results for 2-connected graphs
• An extremal problem on non-full colorable graphs
• scientific article; zbMATH DE number 2086232 (Why is no real title available?)
• scientific article; zbMATH DE number 1472166 (Why is no real title available?)
• scientific article; zbMATH DE number 2220954 (Why is no real title available?)
• On the parameter \(v_ 2(h)\) for \(L_ 2\)-coloured graphs
• \(L(p,q)\)-labeling of fullerene graphs
• Labeling Mycielski graphs with a condition at distance two.
• scientific article; zbMATH DE number 5583498 (Why is no real title available?)
• scientific article; zbMATH DE number 5284085 (Why is no real title available?)

This page was built for publication: The \(L(2,1)\)-labelings on a class of connected full colorable graphs

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