The following pages link to \((k,1)\)-coloring of sparse graphs (Q409448):
Displaying 12 items.
- On 1-improper 2-coloring of sparse graphs (Q393935) (← links)
- \((k,j)\)-coloring of sparse graphs (Q411834) (← links)
- On 2-defective DP-colorings of sparse graphs (Q2225422) (← links)
- Defective DP-colorings of sparse multigraphs (Q2225451) (← links)
- Defective DP-colorings of sparse simple graphs (Q2237221) (← links)
- Near-colorings: non-colorable graphs and NP-completeness (Q2260631) (← links)
- Defective 2-colorings of sparse graphs (Q2434717) (← links)
- Limits of Near-Coloring of Sparse Graphs (Q2874099) (← links)
- (1,<i>k</i>)-Coloring of Graphs with Girth at Least Five on a Surface (Q2978189) (← links)
- List strong linear 2-arboricity of sparse graphs (Q3005110) (← links)
- Defective and clustered choosability of sparse graphs (Q5222556) (← links)
- Sparse critical graphs for defective DP-colorings (Q6204323) (← links)
