scientific article; zbMATH DE number 1775440
From MaRDI portal
Publication:4542572
zbMATH Open1028.68105MaRDI QIDQ4542572FDOQ4542572
Authors: Michael Molloy, Bruce Reed 
Publication date: 27 January 2004
Title of this publication is not available (Why is that?)
Recommendations
Cited In (97)
- Optimal acyclic edge colouring of grid like graphs
- Acyclic edge coloring of planar graphs without 4-cycles
- Improved upper bounds on acyclic edge colorings
- Colouring Non-sparse Random Intersection Graphs
- Improved bounds for acyclic chromatic index of planar graphs
- Some results on acyclic edge coloring of plane graphs
- Improved bounds on the generalized acyclic chromatic number
- Title not available (Why is that?)
- A local strategy to decide the Alperin and Dade conjectures
- Acyclic edge coloring of graphs with large girths
- Further result on acyclic chromatic index of planar graphs
- Un théorème de la limite locale pour des algorithmes Euclidiens
- Acyclic coloring of graphs with some girth restriction
- Probabilistic constructions of computable objects and a computable version of Lovász local lemma
- Local conditions for planar graphs of acyclic edge coloring
- Acyclic edge coloring of planar graphs without 5-cycles
- Acyclic edge coloring of planar graphs with \(\varDelta\) colors
- Acyclic edge colouring of plane graphs
- Acyclic chromatic indices of planar graphs with girth at least five
- Acyclic edge colouring of planar graphs without short cycles
- On \(r\)-acyclic edge colorings of planar graphs
- About acyclic edge colourings of planar graphs
- Acyclic edge coloring of subcubic graphs
- Acyclic edge coloring of planar graphs without adjacent cycles
- Acyclic edge colorings of planar graphs and series parallel graphs
- A note on acyclic edge coloring of complete bipartite graphs
- Short length Menger's theorem and reliable optical routing
- Generalised acyclic edge colourings of graphs with large girth
- Near-optimal list colorings
- Acyclic chromatic indices of fully subdivided graphs
- Acyclic edge coloring of graphs
- New bounds for the acyclic chromatic index
- Improved bounds on coloring of graphs
- Randomly colouring graphs (a combinatorial view)
- On acyclic edge-coloring of complete bipartite graphs
- An improved bound on acyclic chromatic index of planar graphs
- Analysis of a heuristic for acyclic edge colouring
- The fractional congestion bound for efficient edge disjoint routing
- An algorithm for optimal acyclic edge-colouring of cubic graphs
- A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma
- Optimal acyclic edge-coloring of cubic graphs
- Star Chromatic Index
- A new bound on the acyclic edge chromatic number
- Acyclic edge coloring of triangle-free 1-planar graphs
- Acyclic edge coloring of planar graphs without small cycles
- The method of coloring in graphs and its application
- Acyclic total colorings of planar graphs without \(l\) cycles
- Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
- A constructive proof of the general Lovász local lemma
- Improved bounds on acyclic edge colouring
- Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
- Acyclic chromatic indices of planar graphs with large girth
- Acyclic edge colorings of graphs
- Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
- Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma
- Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle
- d‐Regular graphs of acyclic chromatic index at least d+2
- Acyclic chromatic index of planar graphs with triangles
- Acyclic edge-colouring of planar graphs (extended abstract)
- Acyclic edge coloring of graphs with maximum degree 4
- The local cut lemma
- Acyclic edge coloring of planar graphs without cycles of specific lengths
- Acyclic edge-coloring using entropy compression
- The generalized acyclic edge chromatic number of random regular graphs
- Asymptotically optimal frugal colouring
- Acyclic edge chromatic number of outerplanar graphs
- An algorithmic version of the blow-up lemma
- Acyclic edge coloring of 2-degenerate graphs
- Acyclic edge coloring of planar graphs with large girth
- Asymptotically the list colouring constants are 1
- Acyclic edge coloring of 1-planar graphs without 4-cycles
- Planar graphs are acyclically edge \((\Delta + 5)\)-colorable
- Commutativity in the Algorithmic Lovász Local Lemma
- Generalized acyclic edge colorings via entropy compression
- Algorithmic improvements of the Lovász local lemma via cluster expansion
- New algorithmic aspects of the local lemma with applications to routing and partitioning
- Distributed algorithms for the Lovász local lemma and graph coloring
- Acyclic edge coloring of IC-planar graphs
- Random walks that find perfect objects and the Lovász local lemma
- Focused stochastic local search and the Lovász local lemma
- On Effective Computation of Supremal Local Supports
- Distributed algorithms, the Lovász local lemma, and descriptive combinatorics
- Acyclic chromatic index of triangle-free 1-planar graphs
- Acyclic edge coloring of planar graphs with girth at least 5
- Acyclic list edge coloring of 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 chordal graphs with bounded degree
- A local lemma for focused stochastic algorithms
- On acyclic edge coloring of toroidal graphs
- Acyclic edge coloring of 4-regular graphs. II.
- Rainbow Hamilton cycles and lopsidependency
- The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle
- Commutative algorithms approximate the LLL-distribution
- Acyclic list edge coloring of graphs with maximum degree 4
- Finding independent transversals efficiently
- Acyclic edge coloring of 4-regular graphs without 3-cycles
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542572)
