Simple and three-valued simple minimum coloring games (Q343804): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59460132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Core Stability of Minimum Coloring Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations research games: A survey. (With comments and rejoinder) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of the Core of Combinatorial Optimization Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally balanced combinatorial optimization games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonic stable solutions for minimum coloring games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Step out-step in sequencing games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodularity of some classes of the combinatorial optimization games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair cost allocations under conflicts - a game-theoretic point of view - / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex colouring and forbidden subgraphs -- a survey / rank
 
Normal rank

Latest revision as of 00:54, 13 July 2024

scientific article
Language Label Description Also known as
English
Simple and three-valued simple minimum coloring games
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references