"Decomposing graphs into forests of paths with size less than three."

Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang (1991)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2020-03-11

- view
  - electronic edition @ uq.edu.au (open access)
- export record
  dblp key:
  - journals/ajc/ChenFH91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ajc/ChenFH91
Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang:
Decomposing graphs into forests of paths with size less than three. Australas. J Comb. 3: 55-74 (1991)

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.