8 search results - page 1 / 2 » endm 2000 |
ENDM
2000
13 years 4 months ago
2000
ENDM
2000
13 years 4 months ago
2000
ENDM
2000
13 years 4 months ago
2000
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...
ENDM
2000
13 years 4 months ago
2000
A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets AL; AR; SL and SR such that: every vertex of AL is adjacent to every vertex of AR; no ...
ENDM
2000
13 years 4 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...