\((H, k)\)-reachability in \(H\)-arc-colored digraphs

DOI10.1007/s40590-022-00484-xzbMath1514.05066OpenAlexW4313204148MaRDI QIDQ6044470

Germán Benítez-Bobadilla, César Hernández-Cruz, Hortensia Galeana-Sánchez

Publication date: 19 May 2023

Published in: Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40590-022-00484-x

zbMATH Keywords

kernel by monochromatic paths\((H,k)\)-reachabilitykernel by \((H, k)\)-pathskernel by \(H\)-paths

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Cycles and transitivity by monochromatic paths in arc-coloured digraphs
• \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs
• On kernels and semikernels of digraphs
• Kernels by monochromatic paths in \(m\)-colored unions of quasi-transitive digraphs
• A note on kernel-critical graphs
• On monochromatic paths in edge-coloured digraphs
• On the existence of 3- and 4-kernels in digraphs
• \(H\)-kernels in \(H\)-colored digraphs without \(( \xi_1 , \xi , \xi_2 )-H\)-subdivisions of \(\overrightarrow{C_3} \)
• \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs
• On the complexity of the 3-kernel problem in some classes of digraphs
• Kernels in quasi-transitive digraphs
• Reachability problems in edge-colored digraphs
• k-kernels in generalizations of transitive digraphs
• Quasi-Transitive Digraphs and Their Extensions
• Graphes Noyau-Parfaits
• Classes of Directed Graphs
• Digraphs

This page was built for publication: \((H, k)\)-reachability in \(H\)-arc-colored digraphs