Coloring outerplanar graphs and planar 3-trees with small monochromatic components
Data Structures and Algorithms
2019-12-03 v1 Combinatorics
Abstract
In this work, we continue the study of vertex colorings of graphs, in which adjacent vertices are allowed to be of the same color as long as each monochromatic connected component is of relatively small cardinality. We focus on colorings with two and three available colors and present improved bounds on the size of the monochromatic connected components for two meaningful subclasses of planar graphs, namely maximal outerplanar graphs and complete planar 3-trees.
Keywords
Cite
@article{arxiv.1911.10863,
title = {Coloring outerplanar graphs and planar 3-trees with small monochromatic components},
author = {Michael A. Bekos and Carla Binucci and Michael Kaufmann and Chrysanthi Raftopoulou and Antonios Symvonis and Alessandra Tappini},
journal= {arXiv preprint arXiv:1911.10863},
year = {2019}
}