Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Link opens in a new tab
Search content at University of Haifa
Home
Researchers
Research units
Research output
Irredundancy in circular arc graphs
Martin Charles Golumbic
, Renu C. Laskar
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Irredundancy in circular arc graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Circular-arc Graphs
100%
Closed Neighborhood
75%
Irredundant Sets
75%
Irredundance
50%
Disjoint
25%
Number of Vertices
25%
Bipartite Graph
25%
Matching number
25%
Maximum Independent Set
25%
Open Neighborhood
25%
Strong Matching
25%
Mathematics
Bipartite Graph
100%
Maximum Independent Set
100%