"The Algorithmic Complexity of k-Domatic Partition of Graphs."

Hongyu Liang (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-33475-7_17

access: open

type: Conference or Workshop Paper

metadata version: 2018-06-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/ifipTCS/Liang12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ifipTCS/Liang12
Hongyu Liang:
The Algorithmic Complexity of k-Domatic Partition of Graphs. IFIP TCS 2012: 240-249

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.