On \((p, 1)\)-total labelling of NIC-planar graphs

DOI10.1007/s40840-021-01165-0zbMath1477.05164OpenAlexW3186197163MaRDI QIDQ2239035

Bei Niu, San-Yang Liu

Publication date: 2 November 2021

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-021-01165-0

zbMATH Keywords

dischargingstructural theorem\((p-1)\)-total labellingNIC-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)

Cites Work

• Unnamed Item
• Unnamed Item
• Drawing complete multipartite graphs on the plane with restrictions on crossings
• On \((p,1)\)-total labelling of 1-planar graphs
• The structure of 1-planar graphs
• List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
• The structure of plane graphs with independent crossings and its applications to coloring problems
• On \((p, 1)\)-total labelling of some 1-planar graphs
• Linear arboricity of NIC-planar graphs
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
• Ein Sechsfarbenproblem auf der Kugel
• An annotated bibliography on 1-planarity
• \(\mathsf{NIC}\)-planar graphs
• \((p,1)\)-total labelling of graphs
• A survey on labeling graphs with a condition at distance two
• On (p,1)-total labelling of plane graphs with independent crossings
• (d,1)-total labeling of graphs with a given maximum average degree
• Chromatic number, independence ratio, and crossing number
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY

This page was built for publication: On \((p, 1)\)-total labelling of NIC-planar graphs