Acyclic
Summary
A graph is acyclic if it has no cycles. An undirected acyclic graph is the same thing as a forest. 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.
Further reading
- Wikipedia, page 325802, revision 1373839425, Glossary of graph theory, section A. adopted
About this page
| Tag | E98TTKP66A |
|---|---|
| URI | m2://E98TTKP66A |
| Kind | concept |
| Writing | W1 stated |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.