Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,368,087 papers from all fields of science
Search
Sign In
Create Free Account
Exact coloring
In graph theory, an exact coloring is a (proper) vertex coloring in which every pair of colors appears on exactly one pair of adjacent vertices.That…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Complete coloring
Degree (graph theory)
Graph theory
Harmonious coloring
Expand
Broader (1)
Graph coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Improved implementation of some coloring algorithms for the determination of large and sparse Jacobian matrices
Ahamad Imtiaz Khan
2017
Corpus ID: 65183317
When we solve a system of nonlinear equations or nonlinear least-squares problem by Newton’s method or one of its many variants…
Expand
2011
2011
Manhattan-Connected Exact-Coloring is NP-Complete
D. Wilkerson
2011
Corpus ID: 125117211
Consider a matrix. Two cells are “manhattan adjacent horizontally” if their vertical coordinates are the same and their…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE