Drawing graphs with k vertices per face: Complexity and algorithms

A drawing Γ of a graph G divides the plane into topologically connected regions, called faces (or cells). The boundary of each face is formed by vertices, crossings, and edge portions. Given a positive integer k, we say that Γ is a k+-real face drawing of G if the boundary of each face of Γ contains...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1058; p. 115576
Main Authors:	Bekos, Michael A., Di Battista, Giuseppe, Di Giacomo, Emilio, Didimo, Walter, Kaufmann, Michael, Montecchiani, Fabrizio
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 22.12.2025
Subjects:	2-Layer drawings [formula omitted]-real face graphs Beyond-planar graph drawing NP-hardness Recognition algorithms Recognition algorithms NP-hardness Beyond-planar graph drawing k+-real face graphs 2-Layer drawings
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!