Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,284,632 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Bruce Reed (mathematician)
Edge coloring
Entropy compression
Graph coloring game
Expand
Broader (1)
Graph coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The Simple Chromatic Number of (m, n)-Mixed Graphs
Christopher Duffy
,
J. Pas
arXiv.org
2018
Corpus ID: 52269402
An $(m,n)$-mixed graph generalizes the notions of oriented graphs and edge-coloured graphs to a graph object with $m$ arc types…
Expand
2016
2016
Acyclic Coloring of Graphs Navneet Agarwal
Rahul Muthu
2016
Corpus ID: 26878232
In this report we obtain (good) upper bounds on the acyclic chromatic index of graphs obtained as the tensor product of two (or…
Expand
2013
2013
Commentationes Mathematicae Universitatis Carolinae
R. Fabila-Monroy
,
D. Flores
,
C. Huemer
,
A. Montejano
2013
Corpus ID: 207927581
A colored mixed graph has vertices linked by both colored arcs and colored edges. The chromatic number of such a graph G is…
Expand
2012
2012
Acyclic Coloring of Central Graphs
R. Arundhadhi
,
R. Sattanathan
2012
Corpus ID: 62021891
The purpose of this study is to discuss the acyclic coloring and acyclic chromatic number of central graph of cycles(Cn),complete…
Expand
2012
2012
Acyclic 3-Colorings and 4-Colorings of Planar Graph Subdivisions
R. Nishat
2012
Corpus ID: 15777928
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…
Expand
2012
2012
A Simple Research of Divisor Graphs
Yu-Ping Tsao
2012
Corpus ID: 18002919
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…
Expand
2012
2012
Acyclic and Star coloring of Bistar Graph Families
R. Sattanathan
,
D. Vaishnav
2012
Corpus ID: 18928593
In this paper, we discuss about the acyclic chromatic number and star chromatic number of (i) middle graph (ii) central graph and…
Expand
2010
2010
On Acyclic Vertex Coloring of Grid like graphs
B. Joshi
,
Kishore Kothapalli
2010
Corpus ID: 8511989
d-dimensional partial tori are graphs that can be expressed as cartesian product of d graphs each of which is an induced path or…
Expand
2007
2007
Acyclic chromatic number of direct products
A. Horvat
2007
Corpus ID: 117181889
PCT No. PCT/GB85/00113 Sec. 371 Date Nov. 26, 1985 Sec. 102(e) Date Nov. 26, 1985 PCT Filed Mar. 25, 1985 PCT Pub. No. WO85/04314…
Expand
2006
2006
Acyclic colouring of graphs
N. Alon
,
C. McDiarmid
2006
Corpus ID: 16007714
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…
Expand