scientific article

From MaRDI portal
Publication:4050630

zbMath0297.05116MaRDI QIDQ4050630

No author found.

Publication date: 1974


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (31)

Sur les quasi-noyaux d'un graphe. (On quasi-kernels of a graph)Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)Reachability problems in edge-colored digraphsA collective choice method based on individual preferences relational systems (p.r.s.)\((\mathscr{A}, \mathscr{B})\)-kernels and Sands, Sauer and Woodrow's theoremOn Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and FixpointsKernels by rainbow paths in arc-colored tournamentsResults on the small quasi-kernel conjectureAlgorithmic aspects of small quasi-kernelsAt least three minimal quasi-kernelsPerfect graphs, kernels, and cores of cooperative gamesOn monochromatic paths in edge-coloured digraphsComplexity of finding k-path-free dominating sets in graphsA greedy partition lemma for directed dominationNetworks and StabilityKernels by properly colored paths in arc-colored digraphsKing-serf duo by monochromatic paths in \(k\)-edge-coloured tournamentsDiscrete representation of the non-dominated set for multi-objective optimization problems using kernelsOn the existence of \((k,l)\)-kernels in infinite digraphs: a surveyGeneralized solution principles and outranking relations in multi- criteria decision-makingQuasi-kernels of minimum weakness in a graphShort proofs of classical theoremsDomination in DigraphsQuasi-kernels and quasi-sinks in infinite graphsLocally Semicomplete Digraphs and GeneralizationsTowards the small quasi-kernel conjectureDigraphs with unique minimal king setsIndepth combinatorial analysis of admissible sets for abstract argumentationBibliography on domination in graphs and some basic definitions of domination parametersA note on quasi-kernels in digraphsOn Ramsey-Turán type problems in tournaments




This page was built for publication: