Cycles of length 0 modulo k in directed graphs
From MaRDI portal
Publication:1093650
DOI10.1016/0095-8956(89)90071-3zbMath0629.05038MaRDI QIDQ1093650
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
Related Items
Note on alternating directed cycles, An algorithmic approach to the Lovász local lemma. I, A parallel algorithmic version of the local lemma, The Even Cycle Problem for Directed Graphs
Cites Work