Perfect graphs, kernels, and cores of cooperative games (Q2433701): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a lemma of Scarf. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional kernels in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A circular graph---counterexample to the Duchet kernel conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Von Neumann-Morgenstern solutions to cooperative games without side payments / rank
 
Normal rank
Property / cites work
 
Property / cites work: In-tournament digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4070781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4120353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3822190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3822191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent problems and results about kernels in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem in logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parity digraph has a kernel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some operations preserving the existence of kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: On kernels in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the orientation of meyniel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On kernel-perfect orientations of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect graphs are kernel solvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A corrected version of the Duchet kernel conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable effectivity functions and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable families of coalitions and normal hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels in some orientations of comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of kernel-perfect and kernel-perfect-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress on perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial designs related to the strong perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphes Noyau-Parfaits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity graphs are kernel-M-solvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for a digraph to be kernel-perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on kernel-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels in directed graphs: A poison game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3866151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2711192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-blocking polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to a conjecture of Meyniel on kernel-perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem about a conjecture of H. Meyniel on kernel-perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method to extend kernel-perfect graphs to kernel-perfect critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal fraternally orientable graphs satisfy the strong perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of normal fraternally orientable perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels in the closure of coloured digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs all of whose {C_3, T_3}-free arc colorations are kernel-perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: On kernels and semikernels of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On kernel-perfect critical digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orientations of graphs in kernel theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending kernel perfect digraphs to kernel perfect critical digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New extensions of kernel perfect digraphs to kernel imperfect critical digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The list chromatic index of a bipartite multigraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordless Paths, Odd Holes, and Kernels in Graphs Without m-Obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for fraternal orientation of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3035074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4278472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex analysis and convolution operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3917914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3914792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: About quasi-kernels in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of partitioning games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for stability of effectivity functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly balanced cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On kernels in i-triangulated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels in perfect line-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3332693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of effectivity functions and implementation theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2785630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect zero–one matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inductive method for constructing mimmal balanced collections of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3331002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions of irreflexive relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Core of an N Person Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs / rank
 
Normal rank

Latest revision as of 21:25, 24 June 2024

scientific article
Language Label Description Also known as
English
Perfect graphs, kernels, and cores of cooperative games
scientific article

    Statements

    Perfect graphs, kernels, and cores of cooperative games (English)
    0 references
    0 references
    0 references
    30 October 2006
    0 references
    kernel-solvable graphs
    0 references
    kernel-perfect graph
    0 references
    normal hypergraphs
    0 references
    stable family of coalitions
    0 references
    game form
    0 references
    stable effectivity functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers