مقالات سمینار

(1) Almost every graph has reconstruction number three (DOI: 10.1002/jgt.3190140102).

(2) Packing trees into n-chromatic graphs (link).

(3) On clique polynomials (link).

(4) Straight line embeddings of cubic planar graphs with integer edge lengths (link).

در حال تکمیل