Login / Signup
Improved lower bounds on the number of edges in list critical and online list critical graphs.
Hal A. Kierstead
Landon Rabern
Published in:
J. Comb. Theory, Ser. B (2020)
Keyphrases
</>
lower bound
undirected graph
website
small number
learning algorithm
online learning
random graphs
np hard
graph matching