The following pages link to Defective coloring revisited (Q3122895):
Displaying 11 items.
- Improper colouring of graphs with no odd clique minor (Q5222552) (← links)
- Defective and clustered choosability of sparse graphs (Q5222556) (← links)
- Some of My Favorite Coloring Problems for Graphs and Digraphs (Q5506778) (← links)
- (Q5708621) (← links)
- Defective Coloring on Classes of Perfect Graphs (Q5864723) (← links)
- Clustered colouring of graph classes with bounded treedepth or pathwidth (Q5885188) (← links)
- Locally planar graphs are 2-defective 4-paintable (Q5964254) (← links)
- Graph partitions under average degree constraint (Q6187347) (← links)
- Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph (Q6584736) (← links)
- Introduction to competitive graph coloring (Q6599238) (← links)
- Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets (Q6606167) (← links)