作者: Xin Zhang
DOI: 10.1016/J.DISC.2015.12.009
关键词:
摘要: A graph is outer-1-planar if each block has an embedding in the plane such a way that vertices lie on fixed circle and edges inside disk of this with them crossing at most one another. In paper, we completely determine edge chromatic number outer 1-planar graphs.