H-kernels in infinite digraphs

DOI10.1007/S00373-012-1150-6MaRDI QIDQ354449zbMATH OpenOpenAlexFDO

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

Publication date 19 July 2013

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-012-1150-6

zbMATH Keywords

kernelcolor-class digraph\(H\)-kernelkernel by monochromatic path

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38) Infinite graphs (05C63)

Recommendations

• \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class 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
• H-kernels by walks in an \(R_H (D)\) digraph

Cites work

• scientific article; zbMATH DE number 988853 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1153462 (Why is no real title available?)
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• A counterexample to a conjecture on edge-coloured tournaments
• Absorbing sets in arc-coloured tournaments
• Kernels by monochromatic paths and the color-class digraph
• Kernels in edge-colored digraphs
• Kernels in infinite digraphs
• Monotone reachability in arc-colored tournaments
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• On monochromatic paths in m-coloured tournaments
• Perfect graphs, kernels, and cores of cooperative games
• Reachability problems in edge-colored digraphs
• Restricted domination in arc-colored digraphs
• \(H\)-kernels in the \(D\)-join.

Cited in

(15)

• Quasi-kernels and quasi-sinks in infinite graphs
• Richardson's theorem in \(H\)-coloured digraphs
• Trails in arc-colored digraphs avoiding forbidden transitions
• Characterization of color patterns by dynamic \(H\)-paths
• -panchromatic 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
• \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph
• On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
• \(H\)-kernels by walks in subdivision digraph
• Euler dynamic H -trails in edge-colored graphs
• \((\mathscr{A}, \mathscr{B})\)-kernels and Sands, Sauer and Woodrow's theorem
• H-kernels by walks in an \(R_H (D)\) digraph
• Dynamic cycles in edge-colored multigraphs

This page was built for publication: \(H\)-kernels in infinite digraphs

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