scientific article; zbMATH DE number 125461

From MaRDI portal
Publication:4027161





[For the entire collection see Zbl 0748.00023.] The weight of an edge in a graph \(G\) is the sum of degrees of its end vertices. The weight of \(G\), \(w(G)\), is the minimum weight among all its edges. The author shows that for a graph with minimum degree at lest 3 and genus \(g\) it holds \(w(G)\leq 2g+13\) for \(0\leq g\leq 3\), otherwise \(w(G)\leq 4g+7\); and the bounds are best possible.




Cited in
(31)








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 Q4027161)