# Graph Planarity Testing with Hierarchical Embedding Constraints

@article{Liotta2019GraphPT, title={Graph Planarity Testing with Hierarchical Embedding Constraints}, author={G. Liotta and I. Rutter and Alessandra Tappini}, journal={ArXiv}, year={2019}, volume={abs/1904.12596} }

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. FPQ-trees are a variant of PQ-trees that includes F-nodes in addition to P- and to Q-nodes. An F-node represents a permutation that is fixed, i.e., it cannot be reversed. Let $G$ be a graph such that every vertex of $G$ is equipped with a set of FPQ-trees encoding hierarchical embedding constraints for its incident… CONTINUE READING

One Citation

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 40 REFERENCES

A kuratowski-type theorem for planarity of partially embedded graphs

- Mathematics, Computer Science
- 2011

19