A note on 1-planar graphs with minimum degree 7

DOI10.1016/j.dam.2020.10.004zbMath1454.05029arXiv1910.01683OpenAlexW3093860208MaRDI QIDQ2217475

Therese C. Biedl

Publication date: 29 December 2020

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

Full work available at URL: https://arxiv.org/abs/1910.01683

zbMATH Keywords

minimum degree1-planar graphsmallest graph

Mathematics Subject Classification ID

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

Related Items (5)

On the Size of Matchings in 1-Planar Graph with High Minimum Degree ⋮ Matchings in 1‐planar graphs with large minimum degree ⋮ The maximum matching extendability and factor-criticality of 1-planar graphs ⋮ A new note on 1-planar graphs with minimum degree 7 ⋮ The maximal 1-planarity and crossing numbers of graphs

Cites Work

• Unnamed Item
• The structure of 1-planar graphs
• Ein Sechsfarbenproblem auf der Kugel
• On local properties of 1-planar graphs with high minimum degree
• On the Density of Maximal 1-Planar Graphs

This page was built for publication: A note on 1-planar graphs with minimum degree 7