Skip to main navigation
Skip to search
Skip to main content
University of Birmingham Home
Help & FAQ
Home
Research output
Profiles
Research units
Projects
Activities
Datasets
Equipment
Prizes
Press/Media
Search by expertise, name or affiliation
Weak and strong k-connectivity games
Asaf Ferber, Dan Hefetz
Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
16
Citations (Scopus)
195
Downloads (Pure)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Weak and strong k-connectivity games'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Positive Integer
100%
Vertex Connectivity
100%
K-connected
100%
Complete Graph
50%
Edge Set
50%
Winning Strategy
50%
1-move
50%
Mathematics
Positive Integer
100%
Integer
50%
Edge
50%
Complete Graph
50%
Winning Strategy
50%
Computer Science
Positive Integer
100%
Vertex Connectivity
100%
Winning Strategy
50%