Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Home
Researchers
Organisations
Research output
Prizes
Student theses
Courses
Activities
Projects
Press/Media
Datasets
Equipment
Search by expertise, name or affiliation
On relating edges in graphs without cycles of length 4
Vadim E. Levit
, David Tankus
Ariel University
Research output
:
Contribution to journal
›
Article
›
peer-review
10
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On relating edges in graphs without cycles of length 4'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
NP-complete
100%
Polynomial Time
100%
NP-complete Problem
100%
Maximal Independent Set
100%
Relating Edge
100%
Computer Science
Maximal Independent Set
100%
Polynomial Time
100%
Independent Set
100%
Mathematics
Edge
100%
Independent Set
66%
Polynomial Time
33%
Engineering
Polynomial Time
100%