A note on face coloring entire weightings of plane graphs

DOI10.7151/DMGT.1738zbMath1290.05065OpenAlexW1977934624MaRDI QIDQ2450136

Peter Šugerek, Stanlislav Jendroľ

Publication date: 16 May 2014

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

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

zbMATH Keywords

plane graphface colouringentire weighting

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Signed and weighted graphs (05C22)

Related Items (2)

Colourings of graphs by labellings ⋮ A note on vertex colorings of plane graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Neighbor sum distinguishing index
• Entire colouring of plane graphs
• On irregular total labellings
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• On vertex-coloring 13-edge-weighting
• Every planar map is four colorable. I: Discharging
• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Degree constrained subgraphs
• How to Increase Robustness of Capable-to-Promise
• On graph irregularity strength
• NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS

This page was built for publication: A note on face coloring entire weightings of plane graphs