"(Theta, triangle)-free and (even hole, K4)-free graphs. Part 2: ..."

Marcin Pilipczuk et al. (2021)

> Home

Details and statistics

DOI: 10.1002/JGT.22675

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/PilipczukSTT21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/PilipczukSTT21
Marcin Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon:
(Theta, triangle)-free and (even hole, K₄)-free graphs. Part 2: Bounds on treewidth. J. Graph Theory 97(4): 624-641 (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.