Partition and disjoint cycles in digraphs

DOI10.1007/S00373-023-02631-1MaRDI QIDQ2698538zbMATH OpenOpenAlexFDO

Authors Chunjiao Song, Jin Yan

Publication date 24 April 2023

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-023-02631-1

zbMATH Keywords

partitionvertex disjoint cyclesminimum out-degreeprobability method

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Recommendations

• Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
• Disjoint directed cycles
• An improved bound for disjoint directed cycles
• Disjoint Cycles in a Digraph with Partial Degree
• Disjoint cycles of different lengths in graphs and digraphs

Cites work

• scientific article; zbMATH DE number 944226 (Why is no real title available?)
• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs
• An improved bound for disjoint directed cycles
• Cycles in digraphs– a survey
• Digraphs
• Disjoint cycles in digraphs
• Disjoint cycles of different lengths in graphs and digraphs
• Disjoint directed cycles
• Graph colouring and the probabilistic method
• On splitting digraphs
• On the number of vertex-disjoint cycles in digraphs
• Proof of a conjecture of Henning and yeo on vertex-disjoint directed cycles
• Splitting digraphs
• Vertex disjoint cycles of different length in digraphs
• Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz

Cited in

(7)

• Cycle partitions of regular graphs
• Partitions of digraphs into paths or circuits
• Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
• A note on a cycle partition problem
• Two disjoint cycles in digraphs
• Partitioning digraphs with outdegree at least 4
• On the problem of finding disjoint cycles and dicycles in a digraph

This page was built for publication: Partition and disjoint cycles in digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2698538)