Game matching number of graphs (Q2446826): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: William B. Kinnersley / rank
Normal rank
 
Property / author
 
Property / author: William B. Kinnersley / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073362670 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1208.0085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on maximal and maximum matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtrees and subforests of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Problem in Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Winning Fast in Sparse Graph Construction Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The first player wins the one-colour triangle avoidance game on 16 vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity, Colorability, and Minor Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast winning strategies in avoider-enforcer games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds on the size of a maximum matching in a regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected, bounded degree, triangle avoidance games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded degree, triangle avoidance graph games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n-extendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3003877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hajnal's triangle-free game / rank
 
Normal rank

Latest revision as of 11:02, 8 July 2024

scientific article
Language Label Description Also known as
English
Game matching number of graphs
scientific article

    Statements

    Game matching number of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    maximum matching
    0 references
    game parameter
    0 references
    cubic graph
    0 references
    forest
    0 references
    competitive optimization
    0 references
    0 references
    0 references