Yan Li ; Xin Zhang - The structure and the list 3-dynamic coloring of outer-1-planar graphs

dmtcs:5860 - Discrete Mathematics & Theoretical Computer Science, August 27, 2021, vol. 23, no. 3 - https://doi.org/10.46298/dmtcs.5860
The structure and the list 3-dynamic coloring of outer-1-planar graphsArticle

Authors: Yan Li ; Xin Zhang

    An outer-1-planar graph is a graph admitting a drawing in the plane so that all vertices appear in the outer region of the drawing and every edge crosses at most one other edge. This paper establishes the local structure of outer-1-planar graphs by proving that each outer-1-planar graph contains one of the seventeen fixed configurations, and the list of those configurations is minimal in the sense that for each fixed configuration there exist outer-1-planar graphs containing this configuration that do not contain any of another sixteen configurations. There are two interesting applications of this structural theorem. First of all, we conclude that every (resp. maximal) outer-1-planar graph of minimum degree at least 2 has an edge with the sum of the degrees of its two end-vertices being at most 9 (resp. 7), and this upper bound is sharp. On the other hand, we show that the list 3-dynamic chromatic number of every outer-1-planar graph is at most 6, and this upper bound is best possible.


    Volume: vol. 23, no. 3
    Section: Graph Theory
    Published on: August 27, 2021
    Accepted on: August 6, 2021
    Submitted on: October 22, 2019
    Keywords: Mathematics - Combinatorics,Computer Science - Discrete Mathematics,05C10, 05C15

    Consultation statistics

    This page has been seen 937 times.
    This article's PDF has been downloaded 413 times.