Pages that link to "Item:Q4920652"

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

Displaying 3 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)
• Sparse critical graphs for defective DP-colorings (Q6204323) (← links)