OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Acyclic coloring

 Home Mathematics Fields of mathematics Computational mathematics Computational problems in graph theory Graph coloring
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Acyclic coloring is a specific type of graph coloring used in graph theory. The goal of acyclic coloring is to color the vertices of a graph such that no two adjacent vertices share the same color and that the resulting subgraph formed by edges connecting vertices of the same color is acyclic (i.e., it contains no cycles). In more formal terms: - A **graph** is a collection of vertices connected by edges.

 Ancestors (6)

  1. Graph coloring
  2. Computational problems in graph theory
  3. Computational mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook