| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6872610 | Discrete Applied Mathematics | 2012 | 8 Pages |
Abstract
A graph is called 1-planar if there exists its drawing in the plane such that each edge is crossed at most once. We present the full characterization of 1-planar complete k-partite graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Július Czap, Dávid Hudák,