Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles

DOI10.1016/J.DAM.2022.12.017MaRDI QIDQ2689639zbMATH OpenOpenAlexFDO

Authors Shuya Chiba

Publication date 13 March 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2022.12.017

zbMATH Keywords

bipartite graphsdegenerated directed cyclesdegree sumdigraphsdirected cyclespartitions

Mathematics Subject Classification ID

Graph theory (05Cxx)

Recommendations

• Disjoint Cycles in a Digraph with Partial Degree
• Disjoint directed cycles in directed graphs
• Partition and disjoint cycles in digraphs
• scientific article; zbMATH DE number 825135
• Covering the vertices of a digraph by cycles of prescribed length

Cites work

• Covering vertices by a specified number of disjoint cycles, edges and isolated vertices
• Degree conditions for 2-factors
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Directed Hamilton cycles in digraphs and matching alternating Hamilton cycles in bipartite graphs
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• scientific article; zbMATH DE number 863469 (Why is no real title available?)
• Note on Hamilton Circuits
• On degree sum conditions for directed path-factors with a specified number of paths
• On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs
• On pseudo 2-factors
• Partition of a graph into cycles and degenerated cycles
• Partition of a graph into cycles and vertices
• Sufficient Conditions for Circuits in Graphs^†
• Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles
• Weak cycle partition involving degree sum conditions

Cited in

(12)

• Decompositions of digraphs into paths and cycles
• A note about a theorem by Maamoun on decompositions of digraphs into elementary directed paths or cycles
• Covering the vertices of a digraph by cycles of prescribed length
• Partitioning vertices of a tournament into independent cycles
• Partition and disjoint cycles in digraphs
• Note on the existence of directed (k + 1)-cycles in diconnected completek-partite digraphs
• What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?
• Digraphs and variable degeneracy
• On partitioning the edges of an infinite digraph into directed cycles
• Disjoint Cycles in a Digraph with Partial Degree
• Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs
• On partitioning a bipartite graph into cycles and degenerated cycles

This page was built for publication: Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles

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