"Complexity of total outer-connected domination problem in graphs."

B. S. Panda, Arti Pandey (2016)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2015.05.009

access: open

type: Journal Article

metadata version: 2021-06-09

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/PandaP16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/PandaP16
B. S. Panda, Arti Pandey:
Complexity of total outer-connected domination problem in graphs. Discret. Appl. Math. 199: 110-122 (2016)

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.