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

MaRDI QIDQ3404791zbMATH OpenFDO

Authors Wanlian Yuan, Mingqing Zhai, Changhong Lu

Publication date 12 February 2010

zbMATH Keywords

bipartite graph\(L(2,1)\)-labeling\(L(3,2,1)\)-labelingchannel assignment problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• The \(L(3, 2, 1)\)-labelings of bipartite permutation graphs
• \(L(3,2,1)\)-labeling of graphs
• scientific article; zbMATH DE number 7295442
• \(L(3,2,1)\)-labelling of graphs
• scientific article; zbMATH DE number 5972537

Cited in

(13)

• Structural Information and Communication Complexity
• scientific article; zbMATH DE number 7009474 (Why is no real title available?)
• The \(L(3, 2, 1)\)-labelings of bipartite permutation graphs
• On \(\lambda\)-fold Rosa-type labelings of bipartite multigraphs
• scientific article; zbMATH DE number 5972537 (Why is no real title available?)
• scientific article; zbMATH DE number 5584779 (Why is no real title available?)
• scientific article; zbMATH DE number 2145257 (Why is no real title available?)
• \(L(2,1)\)-labeling of perfect elimination bipartite graphs
• Labeling bipartite permutation graphs with a condition at distance two
• scientific article; zbMATH DE number 5545497 (Why is no real title available?)
• Distance two labelings on regular bipartite graphs.
• Structural behaviour of MMD labeling on some SSP bipartite graphs
• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs

This page was built for publication: The \(L(3,2,1)\)-labeling on bipartite graphs

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