WORM Colorings of Planar Graphs

WORM Colorings of Planar Graphs

Given three planar graphs F,H, and G, an (F,H)-WORM coloring of G is a vertex coloring such that no subgraph isomorphic to F is rainbow and no subgraph isomorphic to H is monochromatic. If G has at least one (F,H)-WORM coloring, then W−F,H(G) denotes the minimum number of colors in an (F,H)-WORM col...

Full description

Bibliographic Details
Main Authors: Czap J., Jendrol’ S., Valiska J.
Format: Article
Language:English
Published: Sciendo 2017-05-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
plane graph
monochromatic path
rainbow path
worm coloring
facial coloring
Online Access:https://doi.org/10.7151/dmgt.1921
Description
Summary:Given three planar graphs F,H, and G, an (F,H)-WORM coloring of G is a vertex coloring such that no subgraph isomorphic to F is rainbow and no subgraph isomorphic to H is monochromatic. If G has at least one (F,H)-WORM coloring, then W−F,H(G) denotes the minimum number of colors in an (F,H)-WORM coloring of G. We show that
ISSN:2083-5892

Similar Items