"The algorithmic complexity of signed domination in graphs."

Johannes H. Hattingh, Michael A. Henning, Peter J. Slater (1995)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2020-03-11

- view
  - electronic edition @ uq.edu.au (open access)
- export record
  dblp key:
  - journals/ajc/HattinghHS95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ajc/HattinghHS95
Johannes H. Hattingh, Michael A. Henning, Peter J. Slater:
The algorithmic complexity of signed domination in graphs. Australas. J Comb. 12: 101-112 (1995)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.