Perfect graphs, kernels, and cores of cooperative games
From MaRDI portal
Publication:2433701
Recommendations
Cites work
- A characterization of normal fraternally orientable perfect graphs
- A characterization of perfect graphs
- A circular graph---counterexample to the Duchet kernel conjecture
- A combinatorial problem in logic
- A corrected version of the Duchet kernel conjecture
- A counterexample to a conjecture of Meyniel on kernel-perfect graphs
- A new method to extend kernel-perfect graphs to kernel-perfect critical graphs
- A note on kernel-critical graphs
- A parity digraph has a kernel
- A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
- A sufficient condition for a digraph to be kernel-perfect
- A theorem about a conjecture of H. Meyniel on kernel-perfect graphs
- About quasi-kernels in a digraph
- An algorithm for fraternal orientation of graphs
- An inductive method for constructing mimmal balanced collections of finite sets
- Anti-blocking polyhedra
- Chordless Paths, Odd Holes, and Kernels in Graphs Without m-Obstructions
- College Admissions and the Stability of Marriage
- Colorings and orientations of graphs
- Combinatorial designs related to the strong perfect graph conjecture
- Complex analysis and convolution operators
- Cores of effectivity functions and implementation theory
- Cores of partitioning games
- Extending kernel perfect digraphs to kernel perfect critical digraphs
- Fractional kernels in digraphs
- Games of no chance. Combinatorial games at MSRI. Workshop, July 11--21, 1994 in Berkeley, CA, USA
- Graphes Noyau-Parfaits
- Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs)
- scientific article; zbMATH DE number 4133765 (Why is no real title available?)
- scientific article; zbMATH DE number 3882481 (Why is no real title available?)
- scientific article; zbMATH DE number 3862972 (Why is no real title available?)
- scientific article; zbMATH DE number 3864918 (Why is no real title available?)
- scientific article; zbMATH DE number 3891424 (Why is no real title available?)
- scientific article; zbMATH DE number 3898540 (Why is no real title available?)
- scientific article; zbMATH DE number 3902654 (Why is no real title available?)
- scientific article; zbMATH DE number 3904622 (Why is no real title available?)
- scientific article; zbMATH DE number 4079106 (Why is no real title available?)
- scientific article; zbMATH DE number 4095496 (Why is no real title available?)
- scientific article; zbMATH DE number 4095497 (Why is no real title available?)
- scientific article; zbMATH DE number 3668662 (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 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 3465337 (Why is no real title available?)
- scientific article; zbMATH DE number 3489047 (Why is no real title available?)
- scientific article; zbMATH DE number 3545400 (Why is no real title available?)
- scientific article; zbMATH DE number 497456 (Why is no real title available?)
- scientific article; zbMATH DE number 1929535 (Why is no real title available?)
- scientific article; zbMATH DE number 1444491 (Why is no real title available?)
- scientific article; zbMATH DE number 3226832 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- scientific article; zbMATH DE number 3382402 (Why is no real title available?)
- scientific article; zbMATH DE number 3405983 (Why is no real title available?)
- scientific article; zbMATH DE number 3197630 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- In-tournament digraphs
- Kernels in a special class of digraphs.
- Kernels in directed graphs: A poison game
- Kernels in perfect line-graphs
- Kernels in some orientations of comparability graphs
- Kernels in the closure of coloured digraphs
- KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition
- Necessary and sufficient conditions for stability of effectivity functions
- New extensions of kernel perfect digraphs to kernel imperfect critical digraphs
- Normal fraternally orientable graphs satisfy the strong perfect graph conjecture
- Normal hypergraphs and the perfect graph conjecture
- On a class of kernel-perfect and kernel-perfect-critical graphs
- On a class of kernel-perfect and kernel-perfect-critical graphs.
- On a lemma of Scarf.
- On certain polytopes associated with graphs
- On graphs all of whose \(\{C_3,T_3\}\)-free arc colorations are kernel-perfect
- On kernel-perfect critical digraphs
- On kernel-perfect orientations of line graphs
- On kernels and semikernels of digraphs
- On kernels in i-triangulated graphs
- On kernels in perfect graphs
- On the orientation of meyniel graphs
- Orientations of graphs in kernel theory
- Parity graphs are kernel-M-solvable
- Perfect graphs are kernel solvable
- Perfect zero–one matrices
- Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable
- Planar kernel and Grundy with d 3, dout 2, din 2 are NP- complete
- Progress on perfect graphs
- Recent problems and results about kernels in directed graphs
- Recognizing Berge graphs
- Solutions of irreflexive relations
- Some aspects of minimal imperfect graphs
- Some operations preserving the existence of kernels
- Stable and crossing structures
- Stable effectivity functions and perfect graphs
- Stable families of coalitions and normal hypergraphs
- Strongly balanced cooperative games
- The Core of an N Person Game
- The list chromatic index of a bipartite multigraph
- Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes
- Von Neumann-Morgenstern solutions to cooperative games without side payments
Cited in
(58)- Perfect graphs are kernel solvable
- A corrected version of the Duchet kernel conjecture
- Alternating kernels
- Kernels by properly colored paths in arc-colored digraphs
- Kernels in directed graphs: A poison game
- From kernels in directed graphs to fixed points and negative cycles in Boolean networks
- H-kernels by walks in an \(R_H (D)\) digraph
- Kernels by rainbow paths in arc-colored tournaments
- On effectivity functions of game forms
- Perfect graphs with polynomially computable kernels
- About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs
- On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs
- \((k-1)\)-kernels in strong \(k\)-transitive digraphs
- An extension of Richardson's theorem in m-colored digraphs
- War and peace in veto voting
- \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
- Richardson's theorem for k-colored kernels in strongly connected digraphs
- Kernels by monochromatic paths and color-perfect digraphs
- Richardson's theorem in \(H\)-coloured digraphs
- Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs
- Quasi-transitive digraphs and their extensions
- Miscellaneous digraph classes
- Robust correspondence recognition for computer vision
- Domination in digraphs
- A characterization of locally semicomplete CKI-digraphs
- Disjoint quasi-kernels in digraphs
- \(H\)-kernels in infinite digraphs
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
- Expressive power of digraph solvability
- Finding kernels or solving SAT
- scientific article; zbMATH DE number 1124608 (Why is no real title available?)
- \(k\)-colored kernels
- Kernels in digraphs that are not kernel perfect
- k-kernels in k-transitive and k-quasi-transitive digraphs
- A new characterization of perfect graphs
- \((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs
- Propositional discourse logic
- On panchromatic digraphs and the panchromatic number
- H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.
- A Richardson's theorem version for \(\Pi\)-kernels
- \(H\)-kernels by walks in subdivision digraph
- On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs
- Perfect digraphs
- Kernels by monochromatic paths in digraphs with covering number 2
- CKI-digraphs, generalized sums and partitions of digraphs
- Algorithmic aspects of small quasi-kernels
- On the kernel and related problems in interval digraphs
- Counting kernels in directed graphs with arbitrary orientations
- More on discrete convexity
- Critical kernel imperfectness in 4-quasi-transitive digraphs and 4-anti-transitive digraphs of small diameter
- Poison game for semikernels of arbitrary digraphs
- Compositions of digraphs: a survey
- Local stability in kidney exchange programs
- The theorem of Richardson and its generalizations: a survey
- Argumentation frameworks, games and kernels: time for a family Reunion!
- \(\Pi\)-kernels in digraphs
- A note on kernels and Sperner's Lemma
- A polyhedral approach to the stability of a family of coalitions
This page was built for publication: Perfect graphs, kernels, and cores of cooperative games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433701)
