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
The complexity of comparability graph recognition and coloring
M. C. Golumbic
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The complexity of comparability graph recognition and coloring'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Graph Coloring
100%
Comparability Graphs
100%
Graph Classification
100%
G-decomposition
66%
Number of Edges
33%
Polynomial Time
33%
Maximum Degree
33%
NP-complete Problem
33%
Transitive Orientation
33%
Degree of a Vertex
33%
E-space
33%
Orientability
33%
Quotient Operation
33%
Mathematics
Comparability Graph
100%
Edge
33%
Polynomial Time
33%
Maximum Degree
33%
Degree of a Vertex
33%
Orientability
33%
E-Spaces
33%
Computer Science
Polynomial Time
100%
Quotient Operation
100%