"On the computational complexity of (O, P)-partition problems."

Jan Kratochvíl, Ingo Schiermeyer (1997)

> Home

Details and statistics

DOI: 10.7151/DMGT.1052

access: open

type: Journal Article

metadata version: 2020-06-08

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dmgt/KratochvilS97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmgt/KratochvilS97
Jan Kratochvíl, Ingo Schiermeyer:
On the computational complexity of (O, P)-partition problems. Discuss. Math. Graph Theory 17(2): 253-258 (1997)

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.