Restricted domination in quasi-transitive and 3-quasi-transitive digraphs

DOI10.1016/j.dam.2021.08.004zbMath1473.05228OpenAlexW3195478485MaRDI QIDQ2231781

Marco Antonio López-Ortiz, Rocío Sánchez-López

Publication date: 30 September 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.08.004

zbMATH Keywords

independent setkernelquasi-transitive digraph\(H\)-kernelabsorbent set3-quasi-transitive digraph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Kernels by monochromatic paths in \(m\)-colored unions of quasi-transitive digraphs
• On monochromatic paths in edge-coloured digraphs
• Alternating kernels
• Kernels by properly colored paths in arc-colored digraphs
• A counterexample to a conjecture on edge-coloured tournaments
• The structure of strong arc-locally semicomplete digraphs
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• Kernels by rainbow paths in arc-colored tournaments
• \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs
• Monochromatic absorbency and independence in 3-quasi-transitive digraphs
• Kernels in quasi-transitive digraphs
• Restricted domination in arc-colored digraphs
• \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
• Recent problems and results about kernels in directed graphs
• Reachability problems in edge-colored digraphs
• Kernels by monochromatic paths and the color-class digraph
• Digraphs

This page was built for publication: Restricted domination in quasi-transitive and 3-quasi-transitive digraphs