Complete colorings of planar graphs
classification
🧮 math.CO
keywords
graphsplanarembeddedachromaticasymptoticallyboundscoloringscomplete
read the original abstract
In this paper, we study the achromatic and the pseudoachromatic numbers of planar and outerplanar graphs as well as planar graphs of girth 4 and graphs embedded on a surface. We give asymptotically tight results and lower bounds for maximal embedded graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.