A note on face coloring entire weightings of plane graphs
Given a weighting of all elements of a 2-connected plane graph G = (V,E, F), let f(α) denote the sum of the weights of the edges and vertices incident with the face _ and also the weight of _. Such an entire weighting is a proper face colouring provided that f(α) ≠ f(β) for every two faces α and _ s...
Main Authors: | Jendrol Stanislav, Šugerek Peter |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2014-05-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1738 |
Similar Items
-
A Note On Vertex Colorings Of Plane Graphs
by: Fabricia Igor, et al.
Published: (2014-11-01) -
Facial [r,s,t]-Colorings of Plane Graphs
by: Czap Július, et al.
Published: (2019-08-01) -
Odd facial colorings of acyclic plane graphs
by: Július Czap, et al.
Published: (2021-10-01) -
Facial Rainbow Coloring of Plane Graphs
by: Jendroľ Stanislav, et al.
Published: (2019-11-01) -
Zig-zag facial total-coloring of plane graphs
by: Július Czap, et al.
Published: (2018-01-01)