Class two 1-planar graphs with maximum degree six or seven
Xin Zhang
TL;DR
This paper presents examples of class two 1-planar graphs with maximum degrees of six or seven, expanding understanding of their structural properties.
Contribution
It provides the first known examples of class two 1-planar graphs with maximum degrees six or seven, highlighting new cases in graph theory.
Findings
Examples of class two 1-planar graphs with max degree six
Examples of class two 1-planar graphs with max degree seven
Expands the known range of degrees for such graphs
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Computational Geometry and Mesh Generation · graph theory and CDMA systems