A dichotomy for the kernel by H‐walks problem in digraphs
From MaRDI portal
Publication:4629993
DOI10.1002/jgt.22389zbMath1407.05107arXiv1605.09589OpenAlexW2963439221MaRDI QIDQ4629993
César Hernández-Cruz, Hortensia Galeana-Sánchez
Publication date: 28 March 2019
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.09589
monochromatic pathreachability problemsarc-colored digraphreachability algorithmskernel by \(H\)-walks
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
This page was built for publication: A dichotomy for the kernel by H‐walks problem in digraphs