On the maximum weight of a planar graph of given order and size

DOI10.1016/J.DAM.2014.05.047zbMath1300.05119OpenAlexW1994329195MaRDI QIDQ406330

Mirko Horňák, Tomáš Madaras, Peter Hudák, Andrej Gajdoš

Publication date: 8 September 2014

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

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

zbMATH Keywords

planar graphedge weightgraph weight

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Signed and weighted graphs (05C22)

Related Items (2)

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

Cites Work

• Unnamed Item
• Cyclic 7-edge-cuts in fullerene graphs
• Light subgraphs of graphs embedded in the plane. A survey
• Minimal reducible bounds for planar graphs
• On maximum weight of a bipartite graph of given order and size
• On a max-min problem concerning weights of edges

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