Two disjoint cycles in digraphs

Bermond and Thomassen conjectured that every digraph with minimum outdegree at least contains vertex disjoint cycles. So far the conjecture was verified for . Here we generalise the question asking for all outdegree sequences which force vertex disjoint cycles and give the full answer for .

Saved in:
Bibliographic Details
Published in:Journal of graph theory 2023-11, Vol.104 (3), p.461-469
Main Authors: Lewandowski, Mikołaj, Polcyn, Joanna, Reiher, Christian
Format: Article
Language:English
Subjects:
Graph theory
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Bermond and Thomassen conjectured that every digraph with minimum outdegree at least contains vertex disjoint cycles. So far the conjecture was verified for . Here we generalise the question asking for all outdegree sequences which force vertex disjoint cycles and give the full answer for .
ISSN:0364-9024
1097-0118
DOI:10.1002/jgt.22972