Near Matches
Ignore Exact
Everything
2
Chromatic number (idea)
See all of Chromatic number
, there are 2 more in this node.
(
idea
)
by
artemis entreri
Fri Dec 29 2000 at 1:04:54
In
combinatorics
, the
chromatic number
(
gamma
of G) of a
graph
is the
smallest
number
of
color
s such that
color
s can be assigned to all
node
s of the
graph
without having connected
node
s with the same
color
.
--back to
combinatorics
--
chromatic polynomial
Four color theorem
Combinatorics
graph theory
bipartite graph
minimal criminal
NP-Hard
Constraint satisfaction problem
And as he sang the world began to fall apart
Gene Simmons
girth
Cube graph
Gelatinous cube
Connectivity is not expressible in first-order logic
complete graph
Graph-Colouring Problem
planar graph
NP-complete
chromatic
puma
7
positive
tetrahedral graph
matroid