Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Spanning trees with at most 4 leaves in K1, 5-free graphs."

Yuan Chen, Pham Hoang Ha, Dang Dinh Hanh (2019)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2019.05.005

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/ChenHH19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/ChenHH19
Yuan Chen, Pham Hoang Ha, Dang Dinh Hanh:
Spanning trees with at most 4 leaves in K1, 5-free graphs. Discret. Math. 342(8): 2342-2349 (2019)

a service of

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.