Skip to search formSkip to main contentSkip to account menu

Acyclic coloring

Known as: Acyclic chromatic number, Chromatic (disambiguation) 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
An $(m,n)$-mixed graph generalizes the notions of oriented graphs and edge-coloured graphs to a graph object with $m$ arc types… 
2013
2013
  • 2013
  • Corpus ID: 62561493
The aim of this paper is to determine acyclic chromatic number of the line graph of some special graphs. We also present some… 
2012
2012
The purpose of this study is to discuss the acyclic coloring and acyclic chromatic number of central graph of cycles(Cn),complete… 
2012
2012
An acyclic coloring of a graph G is an assignment of colors to the vertices of G such that no two adjacent vertices receive the… 
2012
2012
Let S be a finite, nonempty set of positive integers. Then, the divisor graph ) (S D of S has S as its vertex set, and vertices i… 
2012
2012
In this paper, we discuss about the acyclic chromatic number and star chromatic number of (i) middle graph (ii) central graph and… 
2010
2010
  • 2010
  • Corpus ID: 62738806
In this paper, we discuss the acyclic vertex colouring and acyclic chromatic number of middle graph, central graph and total… 
2010
2010
In this paper, we discuss the acyclic vertex colouring and acyclic chromatic number of central graph of Dutch-windmill graph and… 
2006
2006
A vertex colouring of a graph G is called acyclic if no two adjacent vertices have the same colour and there is no two-coloured… 
2002
2002
AbstractA coloring of the vertices of a graph is called acyclic if the ends of each edge are colored in distinct colors, and…