On Forbidden Induced Subgraphs for Unit Disk Graphs

Article
  • 10 Downloads

Abstract

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.

Keywords

Unit disk graphs Co-bipartite graphs Forbidden induced subgraphs 

Mathematics Subject Classification

05C75 05C62 

Notes

Acknowledgements

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.

References

  1. 1.
    Atminas, A., Collins, A., Lozin, V., Zamaraev, V.: Implicit representations and factorial properties of graphs. Discrete Math. 338(2), 164–179 (2015)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Balasundaram, B., Butenko, S.: Optimization problems in unit-disk graphs. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 2832–2844. Springer, New York (2009)CrossRefGoogle Scholar
  3. 3.
    Breu, H.: Algorithmic Aspects of Constrained Unit Disk Graphs. PhD Thesis, University of British Columbia (1996).  https://doi.org/10.14288/1.0051600
  4. 4.
    Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Comput. Geom. 9(1), 3–24 (1998)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164(1), 51–229 (2006)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM J. Discrete Math. 10(3), 399–430 (1997)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    da Fonseca, G.D., de Figueiredo, C.M.H., Pereira de Sá, V.G., Machado, R.C.S.: Efficient sub-5 approximations for minimum dominating sets in unit disk graphs. Theor. Comput. Sci. 540(541), 70–81 (2014)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    da Fonseca, G.D., Pereira de Sá, V.G., Machado, R.C.S., de Figueiredo, C.M.H.: On the recognition of unit disk graphs and the distance geometry problem with ranges. Discrete Appl. Math. 197, 3–19 (2015)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Feder, T., Hell, P., Huang, J.: List homomorphisms and circular arc graphs. Combinatorica 19(4), 487–505 (1999)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE 68(12), 1497–1514 (1980)CrossRefGoogle Scholar
  11. 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
  12. 12.
    Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM J. Discrete Math. 5(4), 596–603 (1992)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25(2), 59–68 (1995)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    McDiarmid, C., Müller, T.: Integer realizations of disk and segment graphs. J. Combin. Theory Ser. B 103(1), 114–143 (2013)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    McDiarmid, C., Müller, T.: The number of disk graphs. Eur. J. Combin. 35, 413–431 (2014)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Shrestha, A.M.S., Tayu, S., Ueno, S.: On orthogonal ray graphs. Discrete Appl. Math. 158(15), 1650–1659 (2010)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Spinrad, J.P.: Efficient Graph Representations. Fields Institute Monographs, vol. 19. American Mathematical Society, Providence (2003)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.School of Science and TechnologyNottingham Trent UniversityNottinghamUK
  2. 2.Mathematics InstituteUniversity of WarwickCoventryUK

Personalised recommendations