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

DOI10.1016/J.DAM.2014.05.047zbMATH Open1300.05119OpenAlexW1994329195MaRDI QIDQ406330FDOQ406330

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

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

Recommendations

• scientific article; zbMATH DE number 889952
• 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
• scientific article; zbMATH DE number 426346
• Note on an existence of small degree vertices with at most one big degree neighbour in planar graphs

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)

Cites Work

• Light subgraphs of graphs embedded in the plane. A survey
• On maximum weight of a bipartite graph of given order and size
• Title not available (Why is that?)
• On a max-min problem concerning weights of edges
• Minimal reducible bounds for planar graphs
• Cyclic 7-edge-cuts in fullerene graphs

Cited In (6)

• 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
• Maximum-weight planar boxes in \(O(n^2)\) time (and better)
• A Kotzig type theorem for non-orientable surfaces
• Note on an existence of small degree vertices with at most one big degree neighbour in planar graphs
• The maximum sum of degrees above a threshold in planar graphs

This page was built for publication: On the maximum weight of a planar 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 Q406330)