ON THE MINIMUM WEIGHT OF A 3-CONNECTED 1-PLANAR GRAPH

DOI10.4134/BKMS.b160296zbMath1370.05086OpenAlexW2735682923MaRDI QIDQ5357934

Ning Song, Zai Ping Lu

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

weightlight edge1-planar graph

Mathematics Subject Classification ID

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

Related Items (2)

Light edges in 1‐planar graphs ⋮ The structure and the list 3-dynamic coloring of outer-1-planar graphs

This page was built for publication: ON THE MINIMUM WEIGHT OF A 3-CONNECTED 1-PLANAR GRAPH