Brush your trees!

DOI10.1016/J.DAM.2015.06.004MaRDI QIDQ494441zbMATH OpenOpenAlexFDO

Authors Dieter Rautenbach, A. Ribeiro de Almeida, Lucia Draque Penso

Publication date 1 September 2015

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2015.06.004

zbMATH Keywords

brush numbernetwork cleaningnowhere-zero flows

Mathematics Subject Classification ID

Trees (05C05) Flows in graphs (05C21)

Recommendations

• On the brush number of the Cartesian product of tree with path or cycle
• Brushing without capacity restrictions
• Cleaning with brooms
• Cleaning random graphs with brushes
• Cleaning regular graphs with brushes

Cites work

• Brushing without capacity restrictions
• Cleaning a network with brushes
• Maximum-Minimum Sätze über Graphen

Cited in

(3)

• Forcing brushes
• Brushing number and zero-forcing number of graphs and their line graphs
• Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm

This page was built for publication: Brush your trees!

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494441)