The following pages link to (Q4542572):
Displaying 42 items.
- Acyclic chromatic index of triangle-free 1-planar graphs (Q2409523) (← links)
- The method of coloring in graphs and its application (Q2429917) (← links)
- Acyclic edge coloring of graphs (Q2440127) (← links)
- The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle (Q2444561) (← links)
- Acyclic edge-coloring using entropy compression (Q2444732) (← links)
- Acyclic edge coloring of planar graphs without adjacent cycles (Q2445495) (← links)
- Acyclic edge coloring of planar graphs with girth at least 5 (Q2446889) (← links)
- Improved bounds on acyclic edge colouring (Q2462375) (← links)
- Bounds on the generalised acyclic chromatic numbers of bounded degree graphs (Q2494116) (← links)
- Acyclic edge colorings of graphs (Q2746208) (← links)
- New algorithmic aspects of the local lemma with applications to routing and partitioning (Q2784473) (← links)
- Acyclic edge-colouring of planar graphs (extended abstract) (Q2851497) (← links)
- An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs (Q3004663) (← links)
- Acyclic edge chromatic number of outerplanar graphs (Q3055902) (← links)
- Acyclic edge coloring of 2-degenerate graphs (Q3113277) (← links)
- Colouring Non-sparse Random Intersection Graphs (Q3182958) (← links)
- The generalized acyclic edge chromatic number of random regular graphs (Q3419704) (← links)
- The fractional congestion bound for efficient edge disjoint routing (Q3507649) (← links)
- Acyclic edge coloring of graphs with maximum degree 4 (Q3652530) (← links)
- An algorithmic version of the blow-up lemma (Q4240605) (← links)
- (Q4248539) (← links)
- Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (Q4521547) (← links)
- Near-optimal list colorings (Q4521554) (← links)
- Commutativity in the Algorithmic Lovász Local Lemma (Q4555400) (← links)
- Optimal acyclic edge‐coloring of cubic graphs (Q4650186) (← links)
- Un théorème de la limite locale pour des algorithmes Euclidiens (Q4677381) (← links)
- A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma (Q4810508) (← links)
- Acyclic List Edge Coloring of Graphs (Q4916089) (← links)
- Star Chromatic Index (Q4916092) (← links)
- Finding independent transversals efficiently (Q4987260) (← links)
- (Q5009540) (← links)
- (Q5037979) (← links)
- <i>d</i>‐Regular graphs of acyclic chromatic index at least <i>d</i>+2 (Q5190332) (← links)
- A Local Lemma for Focused Stochastic Algorithms (Q5242924) (← links)
- On Effective Computation of Supremal Local Supports (Q5282201) (← links)
- Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4 (Q5325950) (← links)
- Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles (Q5918364) (← links)
- Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles (Q5918607) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- Distributed algorithms, the Lovász local lemma, and descriptive combinatorics (Q6107878) (← links)
- Acyclic edge coloring of 1-planar graphs without 4-cycles (Q6137646) (← links)
- Planar graphs are acyclically edge \((\Delta + 5)\)-colorable (Q6571271) (← links)
