On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints

DOI10.1137/0606006zbMath0554.05032OpenAlexW2017487139MaRDI QIDQ3216679

Gunther Schmidt, Thomas Ströhlein

Publication date: 1985

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0606006

zbMATH Keywords

relational algebrachess endingskernels of graphslattices and fixpointssolutions of games

Mathematics Subject Classification ID

2-person games (91A05) Applications of game theory (91A80) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Other classical set theory (including functions, relations, and set algebra) (03E20) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (4)

Computing kernels in directed bichromatic graphs ⋮ Choices and kernels in bipolar valued digraphs ⋮ On fuzzification of some concepts of graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• Relativization and extension of solutions of irreflexive relations
• An extension and simple proof of a constrained lattice fixed point theorem
• A note on kernel-critical graphs
• A counterexample to a conjecture of Meyniel on kernel-perfect graphs
• Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete
• Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes
• Analyzing games by Boolean matrix iteration
• Quasi-kernels of minimum weakness in a graph
• Two-person games on graphs
• Generalization of a kernel of a graph
• Über die Bestimmung von Kernen in endlichen Graphen
• Solutions of irreflexive relations
• A lattice-theoretical fixpoint theorem and its applications
• Definitions for a theory of games and pursuit
• A note concerning asymmetric games on graphs
• Subsolutions and the Supercore of Cooperative Games
• Graphes Noyau-Parfaits
• A lattice fixed-point theorem with constraints
• On kernels in strongly connected graphs
• Graphs and composite games
• On a Problem of C. Berge
• Extension Theorems for Solutions of Irreflexive Relations
• On weakly ordered systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints