"Triangle-free graphs of tree-width t are ⌈ (t+3)/2 ⌉-colorable."

Zdenek Dvorák, Ken-ichi Kawarabayashi (2017)

> Home

Details and statistics

DOI: 10.1016/J.EJC.2017.06.016

access: closed

type: Journal Article

metadata version: 2023-12-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ejc/DvorakK17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/DvorakK17
Zdenek Dvorák, Ken-ichi Kawarabayashi:
Triangle-free graphs of tree-width t are ⌈ (t+3)/2 ⌉-colorable. Eur. J. Comb. 66: 95-100 (2017)

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.