Kernels by monochromatic paths and color-perfect digraphs
From MaRDI portal
Publication:274681
DOI10.7151/dmgt.1860zbMath1338.05100OpenAlexW2324111084MaRDI QIDQ274681
Rocío Sánchez-López, Hortensia Galeana-Sánchez
Publication date: 25 April 2016
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1860
kernelcolor-class digraphcolor-perfect digraphkernel by monochromatic pathskernel perfect digraphquasi color-perfect digraph
Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On kernels and semikernels of digraphs
- On monochromatic paths in m-coloured tournaments
- On monochromatic paths in edge-coloured digraphs
- Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete
- Kernels in edge-colored digraphs
- A counterexample to a conjecture on edge-coloured tournaments
- On monochromatic paths and monochromatic cycles in edge coloured tournaments
- Perfect graphs, kernels, and cores of cooperative games
- Recent problems and results about kernels in directed graphs
- Reachability problems in edge-colored digraphs
- Solutions of irreflexive relations
- Kernels by monochromatic paths and the color-class digraph
- Graphes Noyau-Parfaits
- Extension Theorems for Solutions of Irreflexive Relations
This page was built for publication: Kernels by monochromatic paths and color-perfect digraphs
