H-kernels by walks in H-colored digraphs and the color-class digraph

DOI10.1016/J.AKCEJ.2016.06.005MaRDI QIDQ334121zbMATH OpenOpenAlexFDO

Authors Hortensia Galeana-Sánchez, Rocio Sanchez-Lopez

Publication date 31 October 2016

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.akcej.2016.06.005

zbMATH Keywords

kernelcolor-class digraphkernel by monochromatic paths\(H\)-kernel

Mathematics Subject Classification ID

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

Recommendations

• \(H\)-kernels in infinite digraphs
• H-kernels by walks in an \(R_H (D)\) digraph
• \(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
• Restricted domination in arc-colored digraphs

Cites work

• scientific article; zbMATH DE number 988853 (Why is no real title available?)
• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• scientific article; zbMATH DE number 1153462 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• Kernels by monochromatic paths and the color-class digraph
• Kernels in edge-colored 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
• Reachability problems in edge-colored digraphs
• Restricted domination in arc-colored digraphs
• \(H\)-kernels in infinite digraphs
• \(H\)-kernels in the \(D\)-join.

Cited in

(13)

• Characterization of color patterns by dynamic \(H\)-paths
• \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs
• -panchromatic digraphs
• \((H, k)\)-reachability in \(H\)-arc-colored digraphs
• \(H\)-kernels in infinite digraphs
• \(H\)-kernels in \(H\)-colored digraphs without \(( \xi_1 , \xi , \xi_2 )-H\)-subdivisions of \(\overrightarrow{C_3} \)
• H-kernels by walks
• \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
• Independent restricted domination and the line digraph
• On kernels by rainbow paths in arc-coloured digraphs
• \(H\)-kernels by walks in subdivision digraph
• H-kernels by walks in an \(R_H (D)\) digraph
• A dichotomy for the kernel by H‐walks problem in digraphs

This page was built for publication: \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph

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