H-kernels in infinite digraphs

DOI10.1007/S00373-012-1150-6zbMATH Open1268.05090OpenAlexW1979104723MaRDI QIDQ354449FDOQ354449

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On monochromatic paths in edge-coloured digraphs
• Perfect graphs, kernels, and cores of cooperative games
• Kernels by monochromatic paths and the color-class digraph
• Title not available (Why is that?)
• Title not available (Why is that?)
• On monochromatic paths in m-coloured tournaments
• Kernels in edge-colored digraphs
• A counterexample to a conjecture on edge-coloured tournaments
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• Reachability problems in edge-colored digraphs
• Title not available (Why is that?)
• Restricted domination in arc-colored digraphs
• Monotone reachability in arc-colored tournaments
• Title not available (Why is that?)
• Absorbing sets in arc-coloured tournaments
• \(H\)-kernels in the \(D\)-join.
• Kernels in infinite digraphs

Cited In (10)

• Quasi-kernels and quasi-sinks in infinite graphs
• Trails in arc-colored digraphs avoiding forbidden transitions
• Richardson's theorem in \(H\)-coloured digraphs
• -panchromatic digraphs
• \(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
• Euler dynamic H -trails in edge-colored graphs
• \((\mathscr{A}, \mathscr{B})\)-kernels and Sands, Sauer and Woodrow's theorem
• 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)