A note on digraph splitting

DOI10.1017/S0963548325000045MaRDI QIDQ6879470zbMATH OpenFDO

Authors Micha Christoph, Kalina Petrova, Raphael Steiner

Publication date 30 December 2025

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S0963548325000045

zbMATH Keywords

digraphdirected graphsminimum out-degreesplitting

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• A note on subdigraphs of digraphs with large outdegrees
• An improved bound for disjoint directed cycles
• Disjoint cycles in digraphs
• Disjoint directed cycles
• Even cycles in directed graphs
• Generalized Majority Colourings of Digraphs
• Graph decomposition with constraints on the connectivity and minimum degree
• scientific article; zbMATH DE number 944226 (Why is no real title available?)
• scientific article; zbMATH DE number 3243267 (Why is no real title available?)
• Linear bound for majority colourings of digraphs
• Majority choosability of digraphs
• Majority colorings of sparse digraphs
• Majority colourings of digraphs
• On splitting digraphs
• Out-colourings of digraphs
• Partitioning problems via random processes
• Splitting digraphs
• Subdigraphs of prescribed size and out‐degree

Cited in

(1)

• Unavoidable subgraphs in digraphs with large out-degrees

This page was built for publication: A note on digraph splitting

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