"A decomposition for digraphs with minimum outdegree 3 having no vertex ..."

Ngo Dac Tan (2023)

> Home

Details and statistics

DOI: 10.7151/DMGT.2381

access: open

type: Journal Article

metadata version: 2023-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dmgt/Tan23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmgt/Tan23
Ngo Dac Tan:
A decomposition for digraphs with minimum outdegree 3 having no vertex disjoint cycles of different lengths. Discuss. Math. Graph Theory 43(2): 573-581 (2023)

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.