Cycles of length 0 modulo k in directed graphs

DOI10.1016/0095-8956(89)90071-3MaRDI QIDQ1093650zbMATH OpenOpenAlexFDO

Authors Nathan Linial, Noga Alon

Publication date 1989

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(89)90071-3

zbMATH Keywords

directed cycleregular digraphs

Mathematics Subject Classification ID

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

Recommendations

• Even cycles in directed graphs
• Cycles and paths of many lengths in bipartite digraphs
• Short cycles in digraphs
• The Even Cycle Problem for Directed Graphs
• Disjoint directed cycles

Cites work

• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• Cycles in digraphs– a survey
• Even cycles in directed graphs
• Every 7-regular digraph contains an even cycle
• On 3-chromatic hypergraphs
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• Sign-nonsingular matrices and even cycles in directed graphs

Cited in

(14)

• Note on alternating directed cycles
• Divisible subdivisions
• scientific article; zbMATH DE number 22956 (Why is no real title available?)
• A parallel algorithmic version of the local lemma
• Majority colorings of sparse digraphs
• The Even Cycle Problem for Directed Graphs
• LATIN 2004: Theoretical Informatics
• Zero sum cycles in complete digraphs
• Cycle lengths modulo \(k\) in expanders
• Every 7-regular digraph contains an even cycle
• On cycles of directed graphs
• An algorithmic approach to the Lovász local lemma. I
• Almost given length cycles in digraphs
• Cycle lengths in expanding graphs

This page was built for publication: Cycles of length 0 modulo k in directed graphs

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