Perfect graphs are kernel solvable
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3882481 (Why is no real title available?)
- scientific article; zbMATH DE number 3889565 (Why is no real title available?)
- scientific article; zbMATH DE number 3902436 (Why is no real title available?)
- scientific article; zbMATH DE number 4060932 (Why is no real title available?)
- scientific article; zbMATH DE number 4079106 (Why is no real title available?)
- scientific article; zbMATH DE number 3726121 (Why is no real title available?)
- scientific article; zbMATH DE number 3729899 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3515502 (Why is no real title available?)
- scientific article; zbMATH DE number 1944138 (Why is no real title available?)
- scientific article; zbMATH DE number 3893229 (Why is no real title available?)
- A characterization of perfect graphs
- Blocking and anti-blocking pairs of polyhedra
- Cores of effectivity functions and implementation theory
- Fractional kernels in digraphs
- Necessary and sufficient conditions for stability of effectivity functions
- On certain polytopes associated with graphs
- On kernels in i-triangulated graphs
- On kernels in perfect graphs
- Perfect zero–one matrices
- Stable effectivity functions and perfect graphs
- Stable families of coalitions and normal hypergraphs
- Strongly balanced cooperative games
- The Core of an N Person Game
Cited in
(32)- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
- Kernels and perfectness in arc-local tournament digraphs
- On kernels in perfect graphs
- A note on kernels and Sperner's Lemma
- A new characterization of perfect graphs
- On effectivity functions of game forms
- scientific article; zbMATH DE number 4095497 (Why is no real title available?)
- Parity graphs are kernel-M-solvable
- Stable families of coalitions and normal hypergraphs
- Perfect digraphs
- Game-perfect semiorientations of forests
- Kernels in perfect line-graphs
- Some sufficient conditions for the existence of kernels in infinite digraphs
- Some operations preserving the existence of kernels
- Stable effectivity functions and perfect graphs
- On the kernel and related problems in interval digraphs
- A polyhedral approach to the stability of a family of coalitions
- Vertex- and edge-minimal and locally minimal graphs
- Kernels in directed graphs: A poison game
- Perfect graphs, kernels, and cores of cooperative games
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Perfect graphs with polynomially computable kernels
- Stable matchings in three-sided systems with cyclic preferences
- Kernels in weighted digraphs
- Fractional solutions for capacitated NTU-games, with applications to stable matchings
- On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs
- Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable
- A Polyhedral Description of Kernels
- Kernels in quasi-transitive digraphs
- Miscellaneous digraph classes
- On kernel-less clique-acyclic orientations of minimally imperfect graphs
This page was built for publication: Perfect graphs are kernel solvable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126176)
