scientific article; zbMATH DE number 3405983
From MaRDI portal
Publication:5672929
Cited in
(17)- Some sufficient conditions for the existence of kernels in infinite digraphs
- Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes
- Quasi-kernels of minimum weakness in a graph
- Choice procedure in fuzzy multicriteria decision analysis based on pairwise comparisons
- Fuzzy sets and decision analysis
- On fuzzification of some concepts of graphs
- Kernels by properly colored paths in arc-colored digraphs
- Kernels by rainbow paths in arc-colored tournaments
- Richardson's theorem in quasi-transitive and pre-transitive digraphs
- Unions of digraphs which become kernel perfect
- Perfect graphs, kernels, and cores of cooperative games
- Recent problems and results about kernels in directed graphs
- Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs
- On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints
- A new generalization of kernels in digraphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Kernels and partial line digraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5672929)
