The following pages link to A note on acyclic vertex-colorings (Q344457):
Displaying 9 items.
- Generalized acyclic edge colorings via entropy compression (Q1743494) (← links)
- Entropy compression versus Lovász local lemma (Q2020021) (← links)
- A new bound on the acyclic edge chromatic number (Q2198378) (← links)
- Acyclic coloring of graphs and entropy compression method (Q2297725) (← links)
- Moser-Tardos resampling algorithm, entropy compression method and the subset gas (Q2693173) (← links)
- Acyclic coloring of graphs (Q3977081) (← links)
- (Q4484776) (← links)
- Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ is Large (Q4631096) (← links)
- Hardness transitions and uniqueness of acyclic colouring (Q6145810) (← links)