Class two 1-planar graphs with maximum degree six or seven
Combinatorics
2011-04-26 v1 Discrete Mathematics
Abstract
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this note we give examples of class two 1-planar graphs with maximum degree six or seven.
Keywords
Cite
@article{arxiv.1104.4687,
title = {Class two 1-planar graphs with maximum degree six or seven},
author = {Xin Zhang},
journal= {arXiv preprint arXiv:1104.4687},
year = {2011}
}
Comments
3 pages, 2 figures