Pages that link to "Item:Q695319"
From MaRDI portal
The following pages link to Acyclically 3-colorable planar graphs (Q695319):
Displaying 7 items.
- A note on the minimum number of choosability of planar graphs (Q266020) (← links)
- List edge and list total coloring of planar graphs with maximum degree 8 (Q328709) (← links)
- Acyclic coloring with few division vertices (Q396683) (← links)
- Minimum number of disjoint linear forests covering a planar graph (Q405685) (← links)
- An efficient case for computing minimum linear arboricity with small maximum degree (Q2414123) (← links)
- (Q5874489) (← links)
- Hardness transitions and uniqueness of acyclic colouring (Q6145810) (← links)
