Pages that link to "Item:Q2444732"

The following pages link to Acyclic edge-coloring using entropy compression (Q2444732):

Displaying 48 items.

• New bounds for the acyclic chromatic index (Q294561) (← links)
• Application of entropy compression in pattern avoidance (Q405191) (← links)
• Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle (Q489715) (← links)
• Acyclic edge coloring through the Lovász local lemma (Q507595) (← links)
• Nonrepetitive colouring via entropy compression (Q524188) (← links)
• On acyclic edge-coloring of complete bipartite graphs (Q729782) (← links)
• Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas (Q743431) (← links)
• Analysis of a heuristic for acyclic edge colouring (Q845729) (← links)
• Acyclic coloring of graphs without bichromatic long path (Q889416) (← links)
• Further result on acyclic chromatic index of planar graphs (Q908318) (← links)
• The list chromatic number of graphs with small clique number (Q1633755) (← links)
• Acyclic edge coloring of 4-regular graphs without 3-cycles (Q1712783) (← links)
• Generalized arboricity of graphs with large girth (Q1732768) (← links)
• Generalized acyclic edge colorings via entropy compression (Q1743494) (← links)
• An upper bound for the choice number of star edge coloring of graphs (Q2008856) (← links)
• Entropy compression versus Lovász local lemma (Q2020021) (← links)
• Coloring graphs without bichromatic cycles or paths (Q2045232) (← links)
• Acyclic edge coloring of chordal graphs with bounded degree (Q2053722) (← links)
• Local conditions for planar graphs of acyclic edge coloring (Q2142486) (← links)
• Another approach to non-repetitive colorings of graphs of bounded degree (Q2195220) (← links)
• A new bound on the acyclic edge chromatic number (Q2198378) (← links)
• Acyclic edge coloring of 4-regular graphs. II. (Q2272610) (← links)
• Acyclic coloring of graphs and entropy compression method (Q2297725) (← links)
• Counting Gallai 3-colorings of complete graphs (Q2312802) (← links)
• The local cut lemma (Q2357223) (← links)
• Acyclic chromatic index of triangle-free 1-planar graphs (Q2409523) (← links)
• Improved upper bound for the degenerate and star chromatic numbers of graphs (Q2410096) (← 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)
• \((2+\epsilon )\)-nonrepetitive list colouring of paths (Q2631100) (← links)
• Moser-Tardos resampling algorithm, entropy compression method and the subset gas (Q2693173) (← links)
• An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles (Q4960448) (← links)
• Acyclic edge colourings of graphs with large girth (Q4978429) (← links)
• (Q5037979) (← links)
• A General Framework for Hypergraph Coloring (Q5093586) (← links)
• Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture (Q5138970) (← links)
• A Local Lemma for Focused Stochastic Algorithms (Q5242924) (← 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)
• Counting colorings of triangle-free graphs (Q6038582) (← links)
• Acyclic edge coloring of 1-planar graphs without 4-cycles (Q6137646) (← links)
• Edge colorings avoiding patterns (Q6181991) (← links)
• On triangle-free list assignments (Q6184549) (← links)
• Planar graphs are acyclically edge \((\Delta + 5)\)-colorable (Q6571271) (← links)
• Coloring of graphs avoiding bicolored paths of a fixed length (Q6604665) (← links)
• On harmonious coloring of hypergraphs (Q6606988) (← links)
• Edge colorings avoiding patterns (Q6621191) (← links)
• Proper conflict-free coloring of graphs with large maximum degree (Q6654118) (← links)