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

zbMATH Open1199.68196MaRDI QIDQ3404791FDOQ3404791

Authors: Wanlian Yuan, Mingqing Zhai, Changhong Lu 

Publication date: 12 February 2010

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

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)

Cited In (13)

• Title not available (Why is that?)
• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
• Structural behaviour of MMD labeling on some SSP bipartite graphs
• Labeling bipartite permutation graphs with a condition at distance two
• Title not available (Why is that?)
• The \(L(3, 2, 1)\)-labelings of bipartite permutation graphs
• Title not available (Why is that?)
• Structural Information and Communication Complexity
• \(L(2,1)\)-labeling of perfect elimination bipartite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On \(\lambda\)-fold Rosa-type labelings of bipartite multigraphs
• Distance two labelings on regular bipartite 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)