A dichotomy for the kernel by H‐walks problem in digraphs
From MaRDI portal
Publication:4629993
DOI10.1002/jgt.22389zbMath1407.05107arXiv1605.09589MaRDI 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 path; reachability problems; arc-colored digraph; reachability algorithms; kernel by \(H\)-walks
05C38: Paths and cycles
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
Related Items