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

DOI10.1007/S00373-015-1634-2zbMATH Open1339.05168OpenAlexW1845343407MaRDI QIDQ293629FDOQ293629

Authors: Mirko Horňák, Ingo Schiermeyer, Stanislav 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

Recommendations

• On the maximum weight of a dense connected graph of given order and size
• On a max-min problem concerning weights of edges
• scientific article; zbMATH DE number 426346
• Graphs of extremal weights
• On maximum weight of a bipartite graph of given order and size

zbMATH Keywords

connected graphweight of a graphweight of an edge

Mathematics Subject Classification ID

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

Cites Work

• On the total coloring of planar graphs.
• Title not available (Why is that?)
• A survey of hereditary properties of graphs
• On the maximum weight of a dense connected graph of given order and size
• On maximum weight of a bipartite graph of given order and size
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the maximum weight of a planar graph of given order and size
• Extending Kotzig's theorem
• On a max-min problem concerning weights of edges
• The structure of 1-planar graphs
• A Kotzig type theorem for non-orientable surfaces
• Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges

Cited In (5)

• Title not available (Why is that?)
• 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
• Graphs of extremal weights
• On maximum weight of a bipartite graph of given order and size

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

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