1-planarity of complete multipartite graphs

Authors:
Július Czap;Dávid Hudák
Affiliations:
Department of Applied Mathematics and Business Informatics, Faculty of Economics, Technical University of Košice, Nmcovej 32, 040 01 Košice, Slovakia;Institute of Mathematics, Faculty of Science, Pavol Jozef Šafárik University, Jesenná 5, 040 01 Košice, Slovakia
Venue:
Discrete Applied Mathematics
Year:
2012

Citing 3
Cited 3

A new proof of the 6 color theorem

Journal of Graph Theory
Efficient Planarity Testing

Journal of the ACM (JACM)
A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs

Algorithmica

Right angle crossing graphs and 1-planarity

Discrete Applied Mathematics
Parameterized complexity of 1-planarity

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
An upper bound on the sum of powers of the degrees of simple 1-planar graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

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.