A Sharp Dirac-Erdős Type Bound for Large Graphs.

Hal A. Kierstead Alexandr V. Kostochka Andrew McConvey

Published in: Comb. Probab. Comput. (2018)

Keyphrases

upper bound
high quality
lower bound
graph matching
graph theory
graph representation
graph theoretic
structured objects
feature selection
data structure
worst case
directed graph
error bounds
labeled graphs