New extremal edge bounds are proved for K3-free (3n-8), K4-free (floor(7n/2)-7), and K5-free (4n-8) 1-planar graphs, with tightness for large n.
Ackerman,On topological graphs with at most four crossings per edge, Comput
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Every 4-connected optimal 2-planar graph is Hamiltonian-connected, with the 4-connectedness condition being sharp via infinitely many 3-connected counterexamples that are non-Hamiltonian.
MAECO-Lite is a new modular ontology for dynamic malware analysis that maintains separation between enduring artifacts and runtime events, leading to improved performance in description logic concept learning.
citing papers explorer
-
A note on optimal 2-planar graphs
Every 4-connected optimal 2-planar graph is Hamiltonian-connected, with the 4-connectedness condition being sharp via infinitely many 3-connected counterexamples that are non-Hamiltonian.