Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Activities
Research Labs / Equipment
Datasets
Projects
Search by expertise, name or affiliation
A Reduction of the Anticoloring Problem to Connected Graphs
D. Berend
,
E. Korach
, S. Zucker
Department of Mathematics
Department of Industrial Engineering and Management
Research output
:
Contribution to journal
›
Article
›
peer-review
4
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A Reduction of the Anticoloring Problem to Connected Graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Connected Graph
100%
Two-color
50%
General Graphs
50%
Adjacent Vertices
50%
Speaking for
50%
Computer Science
Connected Graph
100%
Adjacent Vertex
50%
Mathematics
Connected Graph
100%