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

DOI10.1007/s10878-015-9958-7zbMath1357.05137OpenAlexW1871586193MaRDI QIDQ512891

Lin Sun, Jian Liang Wu

Publication date: 3 March 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9958-7

zbMATH Keywords

discharging method\((p,1)\)-total labellingminimal counterexample

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 ⋮ A structure of 1-planar graph and its applications to coloring problems ⋮ Unnamed Item ⋮ Two results on K-(2,1)-total choosability of planar graphs

Cites Work

• Unnamed Item
• Total colorings of planar graphs without intersecting 5-cycles
• Minimum total coloring of planar graph
• On \((p,1)\)-total labelling of 1-planar 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
• A survey on labeling graphs with a condition at distance two
• The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2
• (d,1)-total labeling of graphs with a given maximum average degree
• Total-Coloring of Plane Graphs with Maximum Degree Nine
• Labelling Graphs with a Condition at Distance 2
• On the $\lambda$-Number of $Q_n $ and Related Graphs

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