Skip to main content
SpringerLink
Log in

A Characterization of Domination Reducible Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

We introduce a hereditary class of domination reducible graphs where the minimum dominating set problem is polynomially solvable, and characterize this class in terms of forbidden induced subgraphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. RUTCOR–Rutgers Center for Operations Research, Rutgers, The State University of New Jersey, 640 Bartholomew Road, Piscataway, NJ 08854-8003, USA

    Igor Ed. Zverovich

Authors
  1. Igor Ed. Zverovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Igor Ed. Zverovich.

Additional information

Acknowledgments The research was supported by DIMACS 2002 and 2003 Awards. The author would like to thank the both referees for their valuable suggestions.

Final version received: October 3, 2003

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zverovich, I. A Characterization of Domination Reducible Graphs. Graphs and Combinatorics 20, 281–289 (2004). https://doi.org/10.1007/s00373-003-0541-0

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-003-0541-0

Key words.

Search

Navigation