Acyclic coloring of graphs
From MaRDI portal
Publication:3977081
DOI10.1002/rsa.3240020303zbMath0735.05036OpenAlexW2024908972WikidataQ60698846 ScholiaQ60698846MaRDI QIDQ3977081
Noga Alon, Bruce A. Reed, Colin J. H. McDiarmid
Publication date: 25 June 1992
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240020303
Related Items
Coloring parameters for graphs on surfaces, Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4, Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings, Acyclic edge coloring of 1-planar graphs without 4-cycles, Hardness transitions and uniqueness of acyclic colouring, Unnamed Item, Edge colorings avoiding patterns, Unnamed Item, Star Chromatic Index, A polyhedral study of the acyclic coloring problem, d‐Regular graphs of acyclic chromatic index at least d+2, A polyhedral study of the acyclic coloring problem, Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles, Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles, Acyclic dominating partitions, Acyclic dominating partitions, Acyclic edge colourings of graphs with large girth, Acyclic choosability of graphs with bounded degree, Improved upper bound for generalized acyclic chromatic number of graphs, Improved bounds on the generalized acyclic chromatic number, Acyclic coloring of graphs with some girth restriction, Acyclic colorings of subcubic graphs, New bounds for the acyclic chromatic index, Acyclic colorings of graphs with bounded degree, Acyclic colorings of products of trees, Analysis of a heuristic for acyclic edge colouring, Acyclic coloring of graphs of maximum degree five: nine colors are enough, Upper bounds for harmonious colorings, Acyclic coloring of graphs with maximum degree 7, On acyclic colorings of graphs on surfaces, Acyclic coloring of claw-free graphs with small degree, Generalised acyclic edge colourings of graphs with large girth, Acyclic chromatic index of triangle-free 1-planar graphs, Edge-coloring of plane multigraphs with many colors on facial cycles, Acyclic coloring with few division vertices, Acyclic coloring of graphs without bichromatic long path, Acyclic colorings of graph subdivisions revisited, Improved upper bounds on acyclic edge colorings, Two lower bounds for $p$-centered colorings, Some results on acyclic edge coloring of plane graphs, Improved bounds on coloring of graphs, Improved bounds on linear coloring of plane graphs, Acyclic vertex coloring of graphs of maximum degree 5, On b-acyclic chromatic number of a graph, A new bound on the acyclic edge chromatic number, Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices, On acyclic edge coloring of toroidal graphs, Graphs with maximum degree \(6\) are acyclically \(11\)-colorable, Acyclic edge coloring of planar graphs without 5-cycles, The method of coloring in graphs and its application, Acyclic edge colouring of plane graphs, Further result on acyclic chromatic index of planar graphs, Acyclic chromatic indices of planar graphs with girth at least five, Acyclic chromatic indices of fully subdivided graphs, On \(r\)-acyclic edge colorings of planar graphs, Frugal, acyclic and star colourings of graphs, Acyclic edge coloring of graphs, Acyclic edge coloring of planar graphs without 4-cycles, Acyclic edge coloring of 4-regular graphs without 3-cycles, A survey of graph coloring - its types, methods and applications, On the adjacent vertex-distinguishing acyclic edge coloring of some graphs, Intersection dimension and graph invariants, The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle, Acyclic edge-coloring using entropy compression, Randomly colouring graphs (a combinatorial view), Acyclic edge coloring of planar graphs without adjacent cycles, Acyclic vertex coloring of graphs of maximum degree six, Acyclic total colorings of planar graphs without \(l\) cycles, Linear choosability of graphs, Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ is Large, Degenerate and star colorings of graphs on surfaces, Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle, Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs, Improved bounds on acyclic edge colouring, An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs, Generalized acyclic edge colorings via entropy compression, On the complexity of generalized chromatic polynomials, Acyclic edge colorings of graphs, Acyclic edge coloring of planar graphs without cycles of specific lengths, Acyclic improper colourings of graphs with bounded maximum degree, Improved bounds for acyclic chromatic index of planar graphs, Acyclically 3-colorable planar graphs, \(\mathcal Q\)-Ramsey classes of graphs, Acyclic edge colouring of planar graphs without short cycles, About acyclic edge colourings of planar graphs, Tree-depth, subgraph coloring and homomorphism bounds, Bounds on the generalised acyclic chromatic numbers of bounded degree graphs, Optimal acyclic edge colouring of grid like graphs, Entropy compression versus Lovász local lemma, Acyclic edge coloring of 4-regular graphs. II., Acyclic edge coloring of IC-planar graphs, Acyclic chromatic indices of planar graphs with large girth, [https://portal.mardi4nfdi.de/wiki/Publication:4521547 Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma], Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6, On acyclic edge-coloring of complete bipartite graphs, Coloring graphs without bichromatic cycles or paths, Acyclic coloring of graphs and entropy compression method, Turán density of 2-edge-colored bipartite graphs with application on \(\{2, 3\}\)-hypergraphs, Bounds on vertex colorings with restrictions on the union of color classes, Acyclic edge coloring of triangle-free 1-planar graphs, On the acyclic chromatic number of Hamming graphs, Acyclic edge coloring of chordal graphs with bounded degree, Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope, Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs, Acyclic edge coloring of planar graphs with large girth, Measurable versions of the Lovász local lemma and measurable graph colorings, Acyclic edge coloring of graphs with maximum degree 4, Acyclic Vertex Coloring of Graphs of Maximum Degree Six, Acyclic coloring of graphs with maximum degree at most six, Acyclic edge coloring of 2-degenerate graphs, Acyclic edge colorings of planar graphs and series parallel graphs, Linear coloring of graphs, The \(r\)-acyclic chromatic number of planar graphs, A Conjecture of Borodin and a Coloring of Grünbaum, Probabilistic methods in coloring and decomposition problems, Acyclic edge-colorings of sparse graphs, The local cut lemma
Cites Work
