On Forbidden Induced Subgraphs for Unit Disk Graphs
A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active study of unit disk graphs very little is known about minimal forbidden induced subgraphs for this class. We found only finitely many minimal non-unit disk graphs in the literature. In this paper we study in a systematic way forbidden induced subgraphs for the class of unit disk graphs. We develop several structural and geometrical tools, and use them to reveal infinitely many new minimal non-unit disk graphs. Further we use these results to investigate structure of co-bipartite unit disk graphs. In particular, we give structural characterization of those co-bipartite unit disk graphs whose edges between parts form a \(C_4\)-free bipartite graph, and show that bipartite complements of these graphs are also unit disk graphs. Our results lead us to propose a conjecture that the class of co-bipartite unit disk graphs is closed under bipartite complementation.
KeywordsUnit disk graphs Co-bipartite graphs Forbidden induced subgraphs
Mathematics Subject Classification05C75 05C62
The authors are grateful to the anonymous reviewers for their careful reading of the paper and many helpful suggestions and comments. Zamaraev acknowledges support from EPSRC, Grant EP/L020408/1; and from Russian Foundation for Basic Research, Grant 14-01-00515-a.
- 3.Breu, H.: Algorithmic Aspects of Constrained Unit Disk Graphs. PhD Thesis, University of British Columbia (1996). https://doi.org/10.14288/1.0051600
- 11.Huson, M.L., Sen, A.: Broadcast scheduling algorithms for radio networks. In: Military Communications Conference, 1995 (MILCOM’95), vol. 2, pp. 647–651. IEEE, Piscataway (1995)Google Scholar
- 17.Spinrad, J.P.: Efficient Graph Representations. Fields Institute Monographs, vol. 19. American Mathematical Society, Providence (2003)Google Scholar