# 2-Graph Coloring (Graph Coloring)

Jump to navigation
Jump to search

## Description

In this case, we wish to determine whether or not a graph is 2-colorable.

## Related Problems

Generalizations: k-Graph Coloring

Related: Chromatic Number, 3-Graph Coloring, 4-Graph Coloring, 5-Graph Coloring, #k-Graph Coloring, #2-Graph Coloring, #3-Graph Coloring, #4-Graph Coloring, #5-Graph Coloring

## Parameters

$n$: number of vertices

$m$: number of edges

## Table of Algorithms

Currently no algorithms in our database for the given problem.