Kernels by paths with a generalized concatenation

DOI10.1016/J.TCS.2026.116247MaRDI QIDQ7396357zbMATH OpenFDO

Authors Germán Benítez-Bobadilla, Hortensia Galeana-Sánchez

Publication date 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116247

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Theory of computing (68Qxx)

Cites work

• -panchromatic digraphs
• \((H, k)\)-reachability in \(H\)-arc-colored digraphs
• \(\Pi\)-kernels in digraphs
• \(H\)-kernels in infinite digraphs
• A Richardson's theorem version for \(\Pi\)-kernels
• Cyclically k-partite digraphs and k-kernels
• Digraphs
• Graph theory
• scientific article; zbMATH DE number 1153462 (Why is no real title available?)
• scientific article; zbMATH DE number 3803484 (Why is no real title available?)
• Kernels by properly colored paths in arc-colored digraphs
• Kernels by rainbow paths in arc-colored tournaments
• Kernels in quasi-transitive digraphs
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• On monochromatic paths in m-coloured tournaments
• On the complexity of the 3-kernel problem in some classes of digraphs
• Panchromatic patterns by paths
• Planar kernel and Grundy with d 3, dout 2, din 2 are NP- complete
• Rainbow connections of graphs: a survey
• Reachability problems in edge-colored digraphs
• Solutions of irreflexive relations

This page was built for publication: Kernels by paths with a generalized concatenation

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