On (p,1)-total labelling of plane graphs with independent crossings

DOI10.2298/FIL1206091ZzbMath1289.05439OpenAlexW2141682828MaRDI QIDQ2856899

Yong Yu, Xin Zhang, Gui Zhen Liu

Publication date: 30 October 2013

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1206091z

zbMATH Keywords

planar graphdischarging1-planar graph

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 (5)

(2,1)-total labelling of planar graphs with large maximum degree ⋮ Drawing complete multipartite graphs on the plane with restrictions on crossings ⋮ On \((p, 1)\)-total labelling of NIC-planar graphs ⋮ Unnamed Item ⋮ Drawing graph joins in the plane with restrictions on crossings

This page was built for publication: On (p,1)-total labelling of plane graphs with independent crossings