A note on triangle-free and bipartite graphs
Discrete Mathematics - Kleitman and combinatorics: a celebration
On the Evolution of Triangle-Free Graphs
Combinatorics, Probability and Computing
Representation of graphs by OBDDs
Discrete Applied Mathematics
Why almost all k-colorable graphs are easy
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
| Hi-index | 0.00 |