Login / Signup
Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12.
Drago Bokal
Zdenek Dvorák
Petr Hlinený
Jesús Leaños
Bojan Mohar
Tilo Wiedera
Published in:
CoRR (2019)
Keyphrases
</>
random graphs
graph representation
low degree
bounded treewidth
graph mining
graph theoretic
graph theory
graph model
series parallel
graph matching
weighted graph
neural network
maximum number
directed graph
np complete
power law
pattern recognition
image sequences
information systems