Abstract
The class doughnut graphs is a subclass of 5-connected planar graphs. In a planar embedding of a doughnut graph of n vertices there are two vertex-disjoint faces each having exactly n/4 vertices and each of all the other faces has exactly three vertices. Recently the class of doughnut graphs is introduced to show that a graph in this class admits a straight-line grid drawing with linear area and hence any spanning subgraph of a doughnut graph also admits a straight-line grid drawing with linear area. But recognition of a spanning subgraph of a doughnut graph is a non-trivial problem, since recognition of a spanning subgraph of a given graph is an NP-complete problem in general. In this paper, we establish a necessary and sufficient condition for a 4-connected planar graph G to be a spanning subgraph of a doughnut graph. We also give a linear-time algorithm to augment a 4-connected planar graph G to a doughnut graph if G satisfies the necessary and sufficient condition.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brandenburg, F., Eppstein, D., Goodrich, M.T., Kobourov, S., Liotta, G., Mutzel, P.: Selected open problems in graph drawing. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 515–539. Springer, Heidelberg (2004)
Di Battista, G., Frati, F.: Small area drawings of outerplanar graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 89–100. Springer, Heidelberg (2006)
Fary, I.: On Straight line representation of planar graphs. Acta Sci. Math. Szeged 11, 229–233 (1948)
de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10, 41–51 (1990)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, New York (1979)
Garg, A., Rusu, A.: Area-efficient drawings of outerplanar graphs. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 129–134. Springer, Heidelberg (2004)
Garg, A., Rusu, A.: A more practical algorithm for drawing binary trees in linear area with arbitrary aspect ratio. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 159–165. Springer, Heidelberg (2004)
Karim, M.R., Rahman, M.S.: Straight-line grid drawings of planar graphs with linear area. In: Hong, S., Ma, K. (eds.) Proc. of Asia-Pacific Symposium on Visualisation 2007, pp. 109–112. IEEE, Los Alamitos (2007)
Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)
Stein, K.S.: Convex maps. Proc. Amer Math. Soc. 2, 464–466 (1951)
Wagner, K.: Bemerkugen zum veierfarben problem. Jasresber. Deutsch. Math-Verien. 46, 26–32 (1936)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karim, M.R., Rahman, M.S. (2008). Four-Connected Spanning Subgraphs of Doughnut Graphs. In: Nakano, Si., Rahman, M.S. (eds) WALCOM: Algorithms and Computation. WALCOM 2008. Lecture Notes in Computer Science, vol 4921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77891-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-77891-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77890-5
Online ISBN: 978-3-540-77891-2
eBook Packages: Computer ScienceComputer Science (R0)