scientific article; zbMATH DE number 1775440
From MaRDI portal
Publication:4542572
zbMath1028.68105MaRDI QIDQ4542572
Michael S. O. Molloy, Bruce A. Reed
Publication date: 27 January 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (85)
Improved bounds on the generalized acyclic chromatic number ⋮ Acyclic coloring of graphs with some girth restriction ⋮ New bounds for the acyclic chromatic index ⋮ Local conditions for planar graphs of acyclic edge coloring ⋮ Analysis of a heuristic for acyclic edge colouring ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:4810508 A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma] ⋮ Colouring Non-sparse Random Intersection Graphs ⋮ Rainbow Hamilton cycles and lopsidependency ⋮ Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4 ⋮ Generalised acyclic edge colourings of graphs with large girth ⋮ Acyclic chromatic index of triangle-free 1-planar graphs ⋮ Acyclic edge coloring of planar graphs without small cycles ⋮ Acyclic edge coloring of graphs with large girths ⋮ Improved upper bounds on acyclic edge colorings ⋮ Some results on acyclic edge coloring of plane graphs ⋮ Distributed algorithms, the Lovász local lemma, and descriptive combinatorics ⋮ Improved bounds on coloring of graphs ⋮ The fractional congestion bound for efficient edge disjoint routing ⋮ Acyclic edge coloring of 1-planar graphs without 4-cycles ⋮ 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 ⋮ Acyclic chromatic index of planar graphs with triangles ⋮ Acyclic edge coloring of planar graphs without 5-cycles ⋮ Acyclic edge coloring of planar graphs with \(\varDelta\) colors ⋮ The method of coloring in graphs and its application ⋮ An improved bound on acyclic chromatic index of planar graphs ⋮ Acyclic edge colouring of plane graphs ⋮ Unnamed Item ⋮ 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 ⋮ Acyclic edge coloring of graphs ⋮ Acyclic edge coloring of planar graphs without 4-cycles ⋮ Acyclic edge coloring of 4-regular graphs without 3-cycles ⋮ 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 edge coloring of planar graphs with girth at least 5 ⋮ Acyclic total colorings of planar graphs without \(l\) cycles ⋮ Unnamed Item ⋮ Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle ⋮ Improved bounds on acyclic edge colouring ⋮ An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs ⋮ Generalized acyclic edge colorings via entropy compression ⋮ Acyclic edge colorings of graphs ⋮ Unnamed Item ⋮ Optimal acyclic edge‐coloring of cubic graphs ⋮ Acyclic List Edge Coloring of Graphs ⋮ Star Chromatic Index ⋮ Acyclic edge coloring of planar graphs without cycles of specific lengths ⋮ Improved bounds for acyclic chromatic index of planar graphs ⋮ Asymptotically optimal frugal colouring ⋮ Acyclic edge colouring of planar graphs without short cycles ⋮ About acyclic edge colourings of planar graphs ⋮ Short length Menger's theorem and reliable optical routing ⋮ Bounds on the generalised acyclic chromatic numbers of bounded degree graphs ⋮ Optimal acyclic edge colouring of grid like graphs ⋮ Acyclic edge coloring of 4-regular graphs. II. ⋮ d‐Regular graphs of acyclic chromatic index at least d+2 ⋮ Acyclic edge coloring of IC-planar graphs ⋮ Near-optimal list colorings ⋮ 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 edge chromatic number of outerplanar graphs ⋮ On acyclic edge-coloring of complete bipartite graphs ⋮ Acyclic edge coloring of subcubic graphs ⋮ 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 edge coloring of triangle-free 1-planar graphs ⋮ Acyclic edge coloring of chordal graphs with bounded degree ⋮ Distributed algorithms for the Lovász local lemma and graph coloring ⋮ Finding independent transversals efficiently ⋮ Acyclic edge coloring of planar graphs with large girth ⋮ Acyclic edge coloring of graphs with maximum degree 4 ⋮ Acyclic edge coloring of 2-degenerate graphs ⋮ A Local Lemma for Focused Stochastic Algorithms ⋮ Acyclic edge colorings of planar graphs and series parallel graphs ⋮ A note on acyclic edge coloring of complete bipartite graphs ⋮ The generalized acyclic edge chromatic number of random regular graphs ⋮ Acyclic edge-colouring of planar graphs. Extended abstract ⋮ Asymptotically the list colouring constants are 1 ⋮ The local cut lemma
This page was built for publication:
