"Covering planar graphs with forests, one having a bounded maximum degree."

Daniel Gonçalves (2008)

> Home

Details and statistics

DOI: 10.1016/J.ENDM.2008.06.033

access: closed

type: Journal Article

metadata version: 2023-02-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/endm/Goncalves08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/Goncalves08
Daniel Gonçalves:
Covering planar graphs with forests, one having a bounded maximum degree. Electron. Notes Discret. Math. 31: 161-165 (2008)

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.