z-logo
open-access-imgOpen Access
A decomposition for digraphs with minimum outdegree 3 having no vertex disjoint cycles of different lengths
Author(s) -
Ngo Dac Tan
Publication year - 2020
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.2381
Subject(s) - combinatorics , mathematics , vertex (graph theory) , disjoint sets , graph

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom