Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On the computational complexity of partial covers of Theta graphs."

Jirí Fiala, Jan Kratochvíl, Attila Pór (2008)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2007.05.051

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/FialaKP08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/FialaKP08
Jirí Fiala, Jan Kratochvíl, Attila Pór:
On the computational complexity of partial covers of Theta graphs. Discret. Appl. Math. 156(7): 1143-1149 (2008)

a service of

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.