V. Linek Bipartite graphs can have any number of independent sets. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1989, v:76, n:2, pp:131-136 [Journal]

Dieter Gernert Inequalities between the domination number and the chromatic number of a graph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1989, v:76, n:2, pp:151-153 [Journal]

Ilona Palásti A distance problem of P. Erdös with some further restrictions. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1989, v:76, n:2, pp:155-156 [Journal]

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP