Two results on K-(2,1)-total choosability of planar graphs

DOI10.1142/S1793830920500810zbMath1459.05291MaRDI QIDQ5859491

Yan Song, Lei Sun

Publication date: 16 April 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

planar graphs\(k\)-cycle\(k\)-\((2,1)\)-total choosable\(L\)-\((2,1)\)-total labeling

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Unnamed Item

Cites Work

• On \((p,1)\)-total labelling of planar graphs
• \([r,s,t\)-colorings of graphs]
• The List \(L(2, 1)\)-labeling of planar graphs
• Labelling Graphs with a Condition at Distance 2
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• (2,1)-total labelling of planar graphs with large maximum degree

This page was built for publication: Two results on K-(2,1)-total choosability of planar graphs