The following pages link to \((k,1)\)-coloring of sparse graphs (Q409448):
Displaying 23 items.
- Coloring, sparseness and girth (Q312271) (← links)
- On 1-improper 2-coloring of sparse graphs (Q393935) (← links)
- Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs (Q404440) (← links)
- \((k,j)\)-coloring of sparse graphs (Q411834) (← links)
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1 (Q665888) (← links)
- \(k\)-forested choosability of planar graphs and sparse graphs (Q764887) (← links)
- Sparse \(H\)-colourable graphs of bounded maximum degree (Q1889843) (← links)
- Every planar graph with girth at least 5 is \((1,9)\)-colorable (Q2124609) (← 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)
- Improper coloring of sparse graphs with a given girth. II: Constructions (Q2800597) (← links)
- Limits of near-coloring of sparse graphs (Q2874099) (← links)
- \(k\)-forested coloring of sparse graphs (Q2886271) (← 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)
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k (Q3055928) (← links)
- A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)
- Defective and clustered choosability of sparse graphs (Q5222556) (← links)
- A GRASP for coloring sparse graphs (Q5938473) (← links)
- Sparse critical graphs for defective DP-colorings (Q6204323) (← links)
