Login / Signup
The size of graphs with clique number m and without nowhere-zero 4-flows.
Zhi-Hong Chen
Published in:
Discret. Math. (1997)
Keyphrases
</>
maximum number
computational complexity
small number
real time
memory requirements
random graphs
grow exponentially
data sets
neural network
data mining
shortest path
social network analysis
space complexity
graph representation
maximum clique