Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Algorithmic aspects of acyclic edge colorings
N. Alon
, A. Zaks
Research output
:
Contribution to journal
›
Article
›
peer-review
44
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Algorithmic aspects of acyclic edge colorings'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Regular Graph
100%
Acyclic Edge Chromatic number
100%
Acyclic Edge Coloring
100%
NP-complete Problem
50%
Color number
50%
Maximum Degree
50%
Polynomial-time Algorithm
50%
Arbitrary Graphs
50%
Large Girth
50%
Proper Coloring
50%
2-color
50%
Mathematics
Edge
100%
Chromatic Number
40%
Regular Graph
40%
Polynomial Time
20%
Maximum Degree
20%
Edge of a Graph
20%
Engineering
Chromatic Number
100%
Polynomial Time
50%
Computer Science
Chromatic Number
100%
polynomial-time algorithm
50%