A Structure of 1-Planar Graph and Its Applications to Coloring Problems
Sign Up to like & getrecommendations! Published in 2019 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-019-02027-0
Abstract: A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge. In this paper, we first give a useful structural theorem for… read more here.
Keywords: list; graph; edge coloring; planar graph ... See more keywords