Work

Coloring outerplanar graphs and planar 3-trees with small monochromatic components

Year: 2019

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1911.10863

Authors: Bekos, Michael A., Binucci, Carla, Kaufmann, Michael, Raftopoulou, Chrysanthi, Symvonis, Antonios, Tappini, Alessandra

Institutions: University of Tübingen, University of Perugia, National Technical University of Athens

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2989846728

Cites: 29

Cited by:

Related to: 20