"Deciding k-Colorability of P5-Free Graphs in ..."

Chính T. Hoàng et al. (2010)

> Home

Details and statistics

DOI: 10.1007/S00453-008-9197-8

access: closed

type: Journal Article

metadata version: 2017-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/HoangKLSS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/HoangKLSS10
Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu:
Deciding k-Colorability of P₅-Free Graphs in Polynomial Time. Algorithmica 57(1): 74-81 (2010)

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.