A Note On Vertex Colorings Of Plane Graphs

Given an integer valued weighting of all elements of a 2-connected plane graph G with vertex set V , let c(v) denote the sum of the weight of v ∈ V and of the weights of all edges and all faces incident with v. This vertex coloring of G is proper provided that c(u) ≠ c(v) for any two adjacent vertic...

Full description

Bibliographic Details
Main Authors: Fabricia Igor, Jendrol’ Stanislav, Soták Roman
Format: Article
Language:English
Published: University of Zielona Góra 2014-11-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.1771