A new vertex-insertion enumeration with isomorphism pruning yields tight characterizations for the largest complete and complete bipartite graphs in k-planar, fan-planar, fan-crossing free, gap-planar, and quasiplanar classes.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
A new vertex-insertion enumeration with isomorphism pruning yields tight characterizations for the largest complete and complete bipartite graphs in k-planar, fan-planar, fan-crossing free, gap-planar, and quasiplanar classes.