CONCEPT OF A VERTEX IN A MATROID AND 3-CONNECTED GRAPHSKELMANS AK.1980; J. GRAPH THEORY; USA; DA. 1980; VOL. 4; NO 1; PP. 13-19; BIBL. 5 REF.Article

GRAPHS WITH AN EXTREMAL NUMBER OF SPANNING TREESKELMANS AK.1980; J. GRAPH THEORY; USA; DA. 1980; VOL. 4; NO 1; PP. 119-122; BIBL. 5 REF.Article

COMPARISON OF GRAPHS BY THEIR NUMBER OF SPANNING TREES.KELMANS AK.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 16; NO 3; PP. 241-261; BIBL. 10 REF.Article

ON CYCLES THROUGH PRESCRIBED VERTICES IN WEAKLY SEPARABLE GRAPHSKELMANS AK; LOMONOSOV MV.1983; DISCRETE MATHEMATICS; ISSN 0012-365X; NLD; DA. 1983; VOL. 46; NO 2; PP. 183-189; BIBL. 10 REF.Article

WHEN M VERTICES IN A K-CONNECTED GRAPH CANNOT BE WALKED ROUND ALONG A SIMPLE CYCLEKELMANS AK; LOMONOSOV MV.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 38; NO 2-3; PP. 317-322; BIBL. 7 REF.Article

A CUBIC 3-CONNECTED GRAPH HAVING NO CYCLE THROUGH GIVEN 10 VERTICES HAS THE "PETERSEN FORM"KELMANS AK; LOMONOSOV MV.1982; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1982; VOL. 6; NO 4; PP. 495-496; BIBL. 2 REF.Article

NONISOMORPHIC TREES WITH THE SAME T-POLYNOMIAL.DINIC EA; KELMANS AK; ZAITSEV MA et al.1977; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1977; VOL. 6; NO 3; PP. 73-76; BIBL. 8 REF.Article