Acyclic coloring
id:
acyclic-coloring-237-16522922
title:
Acyclic coloring
text:
In graph theory, an acyclic coloring is a (proper) vertex coloring in which every 2-chromatic subgraph is acyclic. The acyclic chromatic number A(G) of a graph G is the fewest colors needed in any acyclic coloring of G. Acyclic coloring is often associated with graphs embedded on non-plane surfaces.
brand slug:
wiki
category slug:
encyclopedia
description:
Graph coloring in which all 2-chromatic subgraphs are acyclic
original url:
https://en.wikipedia.org/wiki/Acyclic_coloring
date created:
date modified:
2023-09-07T01:13:04Z
main entity:
{"identifier":"Q4677981","url":"https://www.wikidata.org/entity/Q4677981"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/2/24/Acyclic_coloring.svg","width":800,"height":800}
fields total:
13
integrity:
15