On the maximum weight of a sparse connected graph of given order and size

DOI10.1007/S00373-015-1634-2zbMath1339.05168OpenAlexW1845343407MaRDI QIDQ293629

Mirko Horňák, Ingo Schiermeyer, Stanlislav Jendroľ

Publication date: 9 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1634-2

zbMATH Keywords

connected graphweight of a graphweight of an edge

Mathematics Subject Classification ID

Connectivity (05C40) Signed and weighted graphs (05C22)

Cites Work

• On the maximum weight of a dense connected graph of given order and size
• On the maximum weight of a planar graph of given order and size
• Extending Kotzig's theorem
• The structure of 1-planar graphs
• On maximum weight of a bipartite graph of given order and size
• On the total coloring of planar graphs.
• A survey of hereditary properties of graphs
• Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
• On a max-min problem concerning weights of edges
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the maximum weight of a sparse connected graph of given order and size