Pages that link to "Item:Q412254"
From MaRDI portal
The following pages link to Improved bounds on coloring of graphs (Q412254):
Displayed 31 items.
- New bounds for the acyclic chromatic index (Q294561) (← links)
- On \(r\)-acyclic edge colorings of planar graphs (Q442224) (← links)
- Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle (Q489715) (← links)
- On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\) (Q501029) (← 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)
- Further result on acyclic chromatic index of planar graphs (Q908318) (← links)
- Acyclic edge coloring of 4-regular graphs without 3-cycles (Q1712783) (← links)
- Generalized acyclic edge colorings via entropy compression (Q1743494) (← links)
- Linear arboricity of regular digraphs (Q2013125) (← 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)
- 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)
- 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)
- Acyclic edge-coloring using entropy compression (Q2444732) (← links)
- Commutativity in the Algorithmic Lovász Local Lemma (Q4555400) (← 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 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)
- Acyclic edge coloring of 1-planar graphs without 4-cycles (Q6137646) (← links)
- Hardness transitions and uniqueness of acyclic colouring (Q6145810) (← links)