3 citations · 5 across the 13 of their papers we have counts for
3 papers · 2 filters
Coloring outerplanar graphs and planar 3-trees with small monochromatic components
Michael A. Bekos, Carla Binucci, Michael Kaufmann +3
In this work, we continue the study of vertex colorings of graphs, in which adjacent vertices are allowed to be of the same color as long as each monochromatic connected component…
Simultaneous FPQ-Ordering and Hybrid Planarity Testing
Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
We study the interplay between embedding constrained planarity and hybrid planarity testing. We consider a constrained planarity testing problem, called 1-Fixed Constrained Planari…
Graph Planarity Testing with Hierarchical Embedding Constraints
Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
Hierarchical embedding constraints define a set of allowed cyclic orders for the edges incident to the vertices of a graph. These constraints are expressed in terms of FPQ-trees. F…