Near Matches
Ignore Exact
Everything
2
Chromatic number (idea)
See all of Chromatic number
, there are 2 more in this node.
(
idea
)
by
dsx
Tue Feb 05 2002 at 4:44:00
(
graph theory
):
A property of a
graph
G. The smallest
positive
integer
(denoted χ
G
) that satisfies
P
G
(x) > 0
where P
G
(x) is the
chromatic polynomial
for the
graph
G.
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