Facial [r,s,t]-Colorings of Plane Graphs

Let G be a plane graph. Two edges are facially adjacent in G if they are consecutive edges on the boundary walk of a face of G. Given nonnegative integers r, s, and t, a facial [r, s, t]-coloring of a plane graph G = (V,E) is a mapping f : V ∪ E → {1, . . ., k} such that |f(v1) − f(v2)| ≥ r for ever...

Cijeli opis

Bibliografski detalji

Glavni autori:	Czap Július, Šugerek Peter, Jendrol’ Stanislav, Valiska Juraj
Format:	Artigo
Jezik:	Inglês
Izdano:	University of Zielona Góra 2019-08-01
Serija:	Discussiones Mathematicae Graph Theory
Teme:	plane graph boundary walk edge-coloring vertex-coloring total-coloring 05c10 05c15
Online pristup:	https://doi.org/10.7151/dmgt.2135
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!