Pages that link to "Item:Q2192086"
From MaRDI portal
The following pages link to An improved upper bound for the acyclic chromatic number of 1-planar graphs (Q2192086):
Displaying 6 items.
- IC-Planar Graphs Are 6-Choosable (Q5009330) (← links)
- 1-planar graphs are odd 13-colorable (Q6041551) (← links)
- Acyclic edge coloring of 1-planar graphs without 4-cycles (Q6137646) (← links)
- Hardness transitions and uniqueness of acyclic colouring (Q6145810) (← links)
- IC-planar graphs are odd-10-colorable (Q6160615) (← links)
- The linear 2-arboricity of IC-planar graphs (Q6166036) (← links)
