"A Better Bound on the Largest Induced Forests in Triangle-Free Planar Graph."

Hung Le (2018)

> Home

Details and statistics

DOI: 10.1007/S00373-018-1944-2

access: closed

type: Journal Article

metadata version: 2024-05-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/gc/Le18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/Le18
Hung Le:
A Better Bound on the Largest Induced Forests in Triangle-Free Planar Graph. Graphs Comb. 34(6): 1217-1246 (2018)

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.