# Schiermeyer (3-Graph Coloring Graph Coloring)

Revision as of 11:36, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({1.415}^n)$ == Space Complexity == $O(nm+n^{2})$ loose bound, possibly $O(n+m)$? words ((can be derived from steps of algorithm)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1994 == Reference == https://link.springer.com/chapter/10.1007/3-540-57899-4_51")

## Time Complexity

$O({1.415}^n)$

## Space Complexity

$O(nm+n^{2})$ loose bound, possibly $O(n+m)$? words

((can be derived from steps of algorithm))

## Description

## Approximate?

Exact

## Randomized?

No, deterministic

## Model of Computation

Word RAM

## Year

1994