A note on 1-planar graphs with minimum degree 7
| Autor: | Therese C. Biedl |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: |
FOS: Computer and information sciences
Discrete Mathematics (cs.DM) Applied Mathematics 0211 other engineering and technologies 021107 urban & regional planning 0102 computer and information sciences 02 engineering and technology Computer Science::Computational Geometry 01 natural sciences Graph Planar graph Combinatorics symbols.namesake 010201 computation theory & mathematics symbols FOS: Mathematics Discrete Mathematics and Combinatorics Mathematics - Combinatorics Combinatorics (math.CO) Mathematics Computer Science - Discrete Mathematics |
| Popis: | 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. 4 pages |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|