Pages that link to "Item:Q4920652"

The following pages link to A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652):

Displaying 16 items.

• Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs (Q404440) (← links)
• Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
• Modulo orientations and matchings in graphs (Q2138971) (← links)
• Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923) (← 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)
• Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs (Q2324512) (← links)
• Complexity dichotomy for oriented homomorphism of planar graphs with large girth (Q2355705) (← links)
• Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions (Q2800597) (← links)
• (1,<i>k</i>)-Coloring of Graphs with Girth at Least Five on a Surface (Q2978189) (← links)
• Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
• Vertex Partitions into an Independent Set and a Forest with Each Component Small (Q5009333) (← links)
• (Q6065467) (← links)
• Sparse critical graphs for defective DP-colorings (Q6204323) (← links)