On list chromatic number of L(2,0)-labeling of a complete bipartite graph K₂,n

DOI10.17654/MS099101571zbMATH Open1356.05054OpenAlexW2417895491MaRDI QIDQ2964349FDOQ2964349

Authors: Sawitree Ranmechai, Kittikorn Nakprasit 

Publication date: 24 February 2017

Published in: Far East Journal of Mathematical Sciences (FJMS) (Search for Journal in Brave)

Full work available at URL: http://www.pphmj.com/abstract/9875.htm

Recommendations

• scientific article; zbMATH DE number 5972537
• The \(L(2,1)\)-labeling on total graphs of complete multipartite graphs
• The List \(L(2, 1)\)-labeling of planar graphs
• On the Choice Numbers of Some Complete Multipartite Graphs
• The \(L (2,1)\)-choosability of cycle

zbMATH Keywords

graph coloringlist coloring\(L(i,j)\)-labeling

Mathematics Subject Classification ID

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

This page was built for publication: On list chromatic number of \(L(2,0)\)-labeling of a complete bipartite graph \(K_{2,n}\)

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