The following pages link to Acyclic edge coloring of graphs (Q2440127):
Displaying 16 items.
- Acyclic edge coloring through the Lovász local lemma (Q507595) (← links)
- Optimal acyclic edge colouring of grid like graphs (Q710564) (← links)
- Acyclic edge coloring of triangle-free 1-planar graphs (Q746958) (← links)
- Further result on acyclic chromatic index of planar graphs (Q908318) (← links)
- Efficient algorithms for acyclic colorings of graphs (Q1978502) (← links)
- Acyclic edge coloring of IC-planar graphs (Q2023729) (← links)
- Acyclic chromatic index of triangle-free 1-planar graphs (Q2409523) (← links)
- Acyclic edge-coloring using entropy compression (Q2444732) (← links)
- Acyclic colouring of some line graphs (Q2844386) (← links)
- Acyclic edge coloring of triangle-free toroidal graphs (Q2924785) (← links)
- Acyclic edge coloring of 2-degenerate graphs (Q3113277) (← links)
- Optimal Acyclic Edge Colouring of Grid Like Graphs (Q3591309) (← links)
- Graph colorings and acyclic orientations (Q3768909) (← 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)
- Hardness transitions and uniqueness of acyclic colouring (Q6145810) (← links)