Graph sharing games: complexity and connectivity (Q391088): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2163503431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3060858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to eat 4/9 of a pizza / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Grabbing Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity in graph sharing games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisations and examples of graph classes with bounded expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Properties of Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grabbing the gold / rank
 
Normal rank

Latest revision as of 04:43, 7 July 2024

scientific article
Language Label Description Also known as
English
Graph sharing games: complexity and connectivity
scientific article

    Statements

    Graph sharing games: complexity and connectivity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    graph sharing game
    0 references
    PSPACE-complete problem
    0 references
    \(k\)-connected graph
    0 references

    Identifiers