On the minimum weight of a 3-connected 1-planar graph

DOI10.4134/BKMS.B160296MaRDI QIDQ5357934zbMATH OpenOpenAlexFDO

Authors Zai Ping Lu, Ning Song

Publication date 18 September 2017

Published in Bulletin of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4134/bkms.b160296

zbMATH Keywords

1-planar graphlight edgeweight

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Light edges in 3-connected 2-planar graphs with prescribed minimum degree
• Light edges in 1‐planar graphs
• On the maximum weight of a planar graph of given order and size
• Light edges in 1-planar graphs of minimum degree 3
• scientific article; zbMATH DE number 889952

Cited in

(9)

• On the edge crossing properties of Euclidean minimum weight Laman graphs
• The structure and the list 3-dynamic coloring of outer-1-planar graphs
• A note on the weight of triangle in 1-planar graphs with minimum degree 6
• Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
• Light edges in 1‐planar graphs
• On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs
• Structural properties of LIC-planar graphs
• Light edges in 3-connected 2-planar graphs with prescribed minimum degree
• On the edge crossing properties of Euclidean minimum weight Laman graphs

This page was built for publication: On the minimum weight of a 3-connected 1-planar graph

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