scientific article; zbMATH DE number 6837056

MaRDI QIDQ3134394zbMATH OpenFDO

Authors Zhen-Mu Hong, Jiaao Li, Yang Yang, Xinmin Hou

Publication date 9 February 2018

zbMATH Keywords

broom numberCartesian productcleaning sequencemaximum edge-cut

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On maximum edge cuts of connected digraphs
• On extremal bipartite graphs with given number of cut edges
• Edge-maximal graphs of branchwidth k
• On bounds for the cutting number of a graph
• On the number of edges in maximally linkless graphs
• Edge-cut cycles and cutting numbers of cycles and graphs
• Edge-maximal graphs of branchwidth k: The k-branches
• A note on the minus edge domination number in graphs.

Cited in

(2)

• The brush number of the two-dimensional torus
• Cleaning with brooms

This page was built for publication:

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