Kernels by monochromatic paths in \(m\)-colored unions of quasi-transitive digraphs

DOI10.1016/j.dam.2009.11.005zbMath1225.05111OpenAlexW2020987162MaRDI QIDQ968164

Juan José Montellano-Ballesteros, Bernardo Llano, Hortensia Galeana-Sánchez

Publication date: 5 May 2010

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

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

zbMATH Keywords

kernel by monochromatic paths\(m\)-colored quasi-transitive digraphsquasi-transitive chromatic class

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Infinite quasi-transitive digraphs with domination number 2 ⋮ Kernels by rainbow paths in arc-colored tournaments ⋮ \((H, k)\)-reachability in \(H\)-arc-colored digraphs ⋮ \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs ⋮ Restricted domination in quasi-transitive and 3-quasi-transitive digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• On kernels by monochromatic paths in the corona of digraphs
• On monochromatic paths in m-coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• Absorbing sets in arc-coloured tournaments
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• Semikernels modulo \(F\) and kernels in digraphs
• Kernels in quasi-transitive digraphs
• Quasi‐transitive digraphs

This page was built for publication: Kernels by monochromatic paths in \(m\)-colored unions of quasi-transitive digraphs