"The tree-achieving set and non-separating independent set problem of ..."

Fayun Cao, Han Ren (2025)

> Home

Details and statistics

DOI: 10.7151/DMGT.2522

access: open

type: Journal Article

metadata version: 2025-03-03

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dmgt/CaoR25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmgt/CaoR25
Fayun Cao, Han Ren:
The tree-achieving set and non-separating independent set problem of subcubic graphs. Discuss. Math. Graph Theory 45(1): 81-93 (2025)

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.