---
tag: E98TTKP66A
kind: concept
name: Acyclic
sources:
  - wikipedia: en:325802@r1373839425
    locator: Glossary of graph theory, section A
    note: adopted
    mention: wikipedia://en/325802#CJM4
    sections: [Summary]
inventory: [JZAN5R07NZ]
---

## Summary

A graph is acyclic if it has no cycles. An undirected acyclic graph is the same thing as a [[forest|062D9KXJB1]]. An acyclic directed graph, which is a digraph without directed cycles, is often called a directed acyclic graph, especially in computer science.

An acyclic coloring of an undirected graph is a proper coloring in which every two color classes induce a forest.