Every 1-planar graph of minimum degree at least 3 contains an edge of type (3,≤23), (4,≤11), (5,≤9), (6,≤8), or (7,7).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Light edges in 1-planar graphs of minimum degree 3
Every 1-planar graph of minimum degree at least 3 contains an edge of type (3,≤23), (4,≤11), (5,≤9), (6,≤8), or (7,7).