"Polynomial Treedepth Bounds in Linear Colorings."

Jeremy Kun et al. (2021)

> Home

Details and statistics

DOI: 10.1007/S00453-020-00760-0

access: open

type: Journal Article

metadata version: 2021-05-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/KunOPS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/KunOPS21
Jeremy Kun, Michael P. O'Brien, Marcin Pilipczuk, Blair D. Sullivan:
Polynomial Treedepth Bounds in Linear Colorings. Algorithmica 83(1): 361-386 (2021)

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.