Zero Forcing, Tree Width, and Graph Coloring
2202-3518 (online) 1034-4942 (print)
We show that certain types of zero-forcing sets for a graph give rise to chordal supergraphs and hence to proper colorings.
The Australasian Journal of Combinatorics
Mitchell, L. (2015). Zero forcing, tree width, and graph coloring. Australasian Journal of Combinatorics, 61(1) 19-22. https://ajc.maths.uq.edu.au/pdf/61/ajc_v61_p019.pdf.