Skip to main navigation
Skip to search
Skip to main content
Open University of Israel Home
Pure Tutorial for OUI staff
English
עברית
العربية
Home
Researchers
Research units
Research outputs
Prizes
Activities
Search by expertise, name or affiliation
On extremal k-outconnected graphs
Zeev Nutov
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On extremal k-outconnected graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Tight
100%
Connected Graph
100%
Complete Bipartite Graph
100%
K-connected
100%
Internally Disjoint Paths
100%
Mathematics
Extremal
100%
Edge
100%
Connected Graph
100%
Bipartite Graph
100%