(2,1)-total labelling of planar graphs with large maximum degree

DOI10.1080/09720529.2016.1139850zbMath1495.05312OpenAlexW2962934903MaRDI QIDQ5069984

Guang-Hui Wang, Xin Zhang, Yong Yu, Jin-bo Li, Gui Zhen Liu

Publication date: 19 April 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2016.1139850

zbMATH Keywords

planar graphsdischarging(2,1)-total labelling

Mathematics Subject Classification ID

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

Related Items (5)

On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs ⋮ On \((p, 1)\)-total labelling of some 1-planar graphs ⋮ Unnamed Item ⋮ Two results on K-(2,1)-total choosability of planar graphs ⋮ 1-planar graphs without 4-cycles or 5-cycles are 5-colorable

Cites Work

• Unnamed Item
• \((2,1)\)-Total number of trees with maximum degree three
• On \((d,1)\)-total numbers of graphs
• List edge and list total colourings of multigraphs
• Planar graphs of maximum degree seven are Class I
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
• \((2,1)\)-total labelling of outerplanar graphs
• \((p,1)\)-total labelling of graphs
• On (p,1)-total labelling of plane graphs with independent crossings
• (d,1)-total labeling of graphs with a given maximum average degree

This page was built for publication: (2,1)-total labelling of planar graphs with large maximum degree