4-Labelings and Grid Embeddings of Plane Quadrangulations

Barriére, Lali and Huemer, Clemens (2010) 4-Labelings and Grid Embeddings of Plane Quadrangulations. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 413-414 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_41).

Full text not available from this repository.


Item Type:Conference Paper
Additional Information:10.1007/978-3-642-11805-0_41
Classifications:G Algorithms and Complexity > G.070 Area / Edge Length
G Algorithms and Complexity > G.490 Embeddings
ID Code:1067

Repository Staff Only: item control page

References

Biedl, T., Brandenburg, F.: Drawing planar bipartite graphs with small area. In: Proceedings of the 17th Canadian Conference on Computational Geometry, Windsor, Canada, pp. 105–108 (2005)

Biedl, T., Bretscher, A., Meijer, H.: Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. In: Kratochvíl J. (ed.) GD 1999. LNCS, vol. 1731, pp. ıl, 359–368. Springer, Heidelberg (1999)

Felsner, S.: Convex Drawings of Planar Graphs and the Order Dimension of 3Polytopes. Order 18, 19–37 (2001)

Felsner, S., Fusy, E., Noy, M., Orden, D.: Bijections for Baxter Families and Related Objects (2008), http://arxiv.org/abs/0803.1546

Felsner, S., Huemer, C., Kappes, S., Orden, D.: Binary Labelings for Plane Quadrangulations and their Relatives (2008), http://arxiv.org/abs/math/0612021v3

de Fraysseix, H., de Mendez, P.O., Pach, J.: A left-first search algorithm for planar graphs. Discrete and Computational Geometry 13, 459–468 (1995)

Fusy, E.: Straight-line drawing of quadrangulations. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 234–239. Springer, Heidelberg (2007)

Huemer, C., Kappes, S.: A binary labelling for plane Laman graphs and quadrangulations. In: Proceedings of the 22nd European Workshop on Computational Geometry, Delphi, Greece, pp. 83–86 (2006)

Schnyder, W.: Embedding Planar Graphs on the Grid. In: Proceedings of the first annual ACM-SIAM Symposium on Discrete Algorithms, pp. 138–148 (1990)