A note on 1-planar graphs with minimum degree 7

DOI10.1016/J.DAM.2020.10.004MaRDI QIDQ2217475zbMATH OpenOpenAlexFDO

Authors Therese 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

1-planar graphminimum degreesmallest graph

Mathematics Subject Classification ID

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

Abstract: It is well-known that 1-planar graphs have minimum degree at most 7, and not hard to see that some 1-planar graphs have minimum degree exactly 7. In this note we show that any such 1-planar graph has at least 24 vertices, and this is tight.

Recommendations

• \(K_7\)-minors in optimal 1-planar graphs
• A note on 1-planar graphs
• Every planar graph with maximum degree 7 is of class 1
• Total coloring of planar graphs with maximum degree 7
• Strongly light subgraphs in the 1-planar graphs with minimum degree 7
• scientific article; zbMATH DE number 6746684
• On the vertex-arboricity of planar graphs without 7-cycles
• The linear arboricity of planar graphs with maximum degree at least 7
• Linear arboricity of planar graphs with maximum degree at least seven
• Total coloring of planar graphs with maximum degree seven

Cites work

• Ein Sechsfarbenproblem auf der Kugel
• scientific article; zbMATH DE number 3141016 (Why is no real title available?)
• On local properties of 1-planar graphs with high minimum degree
• On the density of maximal 1-planar graphs
• The structure of 1-planar graphs

Cited in

(13)

• The maximal 1-planarity and crossing numbers of graphs
• \(K_7\)-minors in optimal 1-planar graphs
• Minimal non-1-planar graphs
• Graphs with no \(\bar{P}_7\)-minor
• On local properties of 1-planar graphs with high minimum degree
• On the Size of Matchings in 1-Planar Graph with High Minimum Degree
• A note on the weight of triangle in 1-planar graphs with minimum degree 6
• 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 6-degeneracy of 1-planar graphs
• The matching extendability of 7-connected maximal 1-plane graphs
• The price of connectivity augmentation on planar graphs

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

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