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

DOI10.7151/DMGT.2208MaRDI QIDQ2227112zbMATH OpenOpenAlexFDO

Authors Bei Niu, Xin Zhang

Publication date 10 February 2021

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.2208

zbMATH Keywords

structural theorem\((p, 1)\)-total labelling

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)

Recommendations

• On \((p,1)\)-total labelling of 1-planar graphs
• On \((p,1)\)-total labelling of special 1-planar graphs.
• On \((p,1)\)-total labelling of planar graphs
• On \((p, 1)\)-total labelling of NIC-planar graphs
• On total colorings of 1-planar graphs

Cites work

• scientific article; zbMATH DE number 3900784 (Why is no real title available?)
• (2,1)-total labelling of planar graphs with large maximum degree
• (d,1)-total labeling of graphs with a given maximum average degree
• A new proof of the 6 color theorem
• A structure of 1-planar graph and its applications to coloring problems
• An annotated bibliography on 1-planarity
• Ein Sechsfarbenproblem auf der Kugel
• Graph theory with applications
• Labelling Graphs with a Condition at Distance 2
• List edge and list total coloring of 1-planar graphs
• List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
• On \((p,1)\)-total labelling of 1-planar graphs
• On \((p,1)\)-total labelling of planar graphs
• On edge colorings of \(1\)-planar graphs
• The structure of 1-planar graphs
• Total-Coloring of Plane Graphs with Maximum Degree Nine
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
• \((p,1)\)-total labelling of graphs

Cited in

(11)

• On \((p,1)\)-total labelling of special 1-planar graphs.
• \((p,1)\)-total labelling of graphs
• A note on global dominator coloring of graphs
• Incidence coloring of mycielskians with fast algorithm
• List dynamic coloring of sparse graphs and series-parallel graphs
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
• On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs
• 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
• On \((p,1)\)-total labelling of 1-planar graphs
• On \((p, 1)\)-total labelling of NIC-planar graphs
• A result on \(K\)-\((2,1)\)-total choosability of planar graphs

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

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