H-kernels by walks in an R_H (D) digraph

DOI10.1016/J.AKCEJ.2019.02.009OpenAlexW2921632378WikidataQ128297705 ScholiaQ128297705MaRDI QIDQ2176159FDOQ2176159

Authors: Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, Rocio Sanchez-Lopez, Berta Zavala-Santana 

Publication date: 4 May 2020

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

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

Recommendations

• \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph
• \(H\)-kernels by walks in subdivision digraph
• \(H\)-kernels in infinite digraphs
• H-kernels by walks
• Restricted domination in arc-colored digraphs

zbMATH Keywords

kernelkernel by monochromatic paths\(H\)-kernel by walkssubdivision digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Reachability problems in edge-colored digraphs
• Kernels in infinite digraphs
• Kernels and some operations in edge-coloured digraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• $H$-kernels by walks in subdivision digraph

Cited In (6)

• -panchromatic digraphs
• \(H\)-kernels in infinite digraphs
• \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
• Independent restricted domination and the line digraph
• Primitive Lie PI-algebras
• A dichotomy for the kernel by H‐walks problem in digraphs

This page was built for publication: H-kernels by walks in an \(R_H (D)\) digraph

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