International audienceWe prove that the acyclic chromatic number of a graph with maximum degree ∆ is less than 2.835∆4/3+∆. This improves the previous upper bound, which was 50∆4/3. To do so, we draw inspiration from works by Alon, McDiarmid and Reed and by Esperet and Parreau
AbstractFor graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, co...
AbstractWe prove that the acyclic chromatic index a′(G)⩽6Δ for all graphs with girth at least 9. We ...
AbstractAcyclic coloring problem is a specialized problem that arises in the efficient computation o...
International audienceWe prove that the acyclic chromatic number of a graph with maximum degree ∆ is...
The acyclic chromatic number of a graph is the least number of colors needed to properly color its v...
We develop an improved bound for the chromatic number of graphs of maximum degree $\Delta$ under the...
We present upper bounds for the chromatic number research issued from subgraph of the concerned grap...
International audienceAn acyclic coloring of a graph $G$ is a coloring of its vertices such that: (i...
AbstractThis paper introduces three new upper bounds on the chromatic number, without making any ass...
AbstractGiven a graph G with maximum degree Δ≥3, we prove that the acyclic edge chromatic number a′(...
International audienceA proper edge-coloring with the property that every cycle contains edges of at...
International audienceA proper edge-coloring with the property that every cycle contains edges of at...
We prove new lower bounds on the independence ratio of graphs of maximum degree ∆ ∈ {3,4,5} and g...
International audienceAn acyclic coloring of a graph G is a coloring of its vertices such that: (i) ...
AbstractIt was conjectured by Reed [B. Reed, ω,α, and χ, Journal of Graph Theory 27 (1998) 177–212] ...
AbstractFor graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, co...
AbstractWe prove that the acyclic chromatic index a′(G)⩽6Δ for all graphs with girth at least 9. We ...
AbstractAcyclic coloring problem is a specialized problem that arises in the efficient computation o...
International audienceWe prove that the acyclic chromatic number of a graph with maximum degree ∆ is...
The acyclic chromatic number of a graph is the least number of colors needed to properly color its v...
We develop an improved bound for the chromatic number of graphs of maximum degree $\Delta$ under the...
We present upper bounds for the chromatic number research issued from subgraph of the concerned grap...
International audienceAn acyclic coloring of a graph $G$ is a coloring of its vertices such that: (i...
AbstractThis paper introduces three new upper bounds on the chromatic number, without making any ass...
AbstractGiven a graph G with maximum degree Δ≥3, we prove that the acyclic edge chromatic number a′(...
International audienceA proper edge-coloring with the property that every cycle contains edges of at...
International audienceA proper edge-coloring with the property that every cycle contains edges of at...
We prove new lower bounds on the independence ratio of graphs of maximum degree ∆ ∈ {3,4,5} and g...
International audienceAn acyclic coloring of a graph G is a coloring of its vertices such that: (i) ...
AbstractIt was conjectured by Reed [B. Reed, ω,α, and χ, Journal of Graph Theory 27 (1998) 177–212] ...
AbstractFor graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, co...
AbstractWe prove that the acyclic chromatic index a′(G)⩽6Δ for all graphs with girth at least 9. We ...
AbstractAcyclic coloring problem is a specialized problem that arises in the efficient computation o...
DOI
Add to ORKG