A finite graph is bipartite exactly when it has a proper colouring with two colours. Equivalently,
(1)
for its chromatic polynomial.

Ancestors (6)

  1. Bipartite graph
  2. Graph theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6. Home

Incoming links (2)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version