Light edges in 3-connected 2-planar graphs with prescribed minimum degree

DOI10.1007/s40840-016-0389-0zbMath1393.05090OpenAlexW2465686426MaRDI QIDQ723598

Zai Ping Lu, Ning Song

Publication date: 24 July 2018

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-016-0389-0

zbMATH Keywords

weightlight edge2-planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On drawings and decompositions of 1-planar graphs
• 1-planarity of complete multipartite graphs
• On edge colorings of 1-planar graphs without adjacent triangles
• Improving the crossing lemma by finding more crossings in sparse graphs
• The structure of 1-planar graphs
• Graphs drawn with few crossings per edge
• Light subgraphs of graphs embedded in the plane. A survey
• On edge colorings of \(1\)-planar graphs
• Ein Sechsfarbenproblem auf der Kugel
• On the total coloring of planar graphs.
• Acyclic colouring of 1-planar graphs

This page was built for publication: Light edges in 3-connected 2-planar graphs with prescribed minimum degree