Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research Units
Facilities
Projects
Research output
Search by expertise, name or affiliation
Covering graphs by the minimum number of equivalence relations
Noga Alon
Research output
:
Contribution to journal
›
Article
›
peer-review
44
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Covering graphs by the minimum number of equivalence relations'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Assertion
23%
Complement
35%
Complete Graph
21%
Cover
34%
Covering Graph
100%
Cycle
16%
Disjoint
18%
Equivalence
32%
Equivalence relation
69%
Exterior Algebra
30%
Generalise
12%
Graph in graph theory
32%
Lower bound
15%
Subgraph
38%
Union
18%
Upper bound
15%
Vertex of a graph
13%