ON GRAPHS WITH AT MOST FOUR LINE-DISJOINT PATHS CONNECTING ANY TWO VERTICESLEONARD JL.1972; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1972; VOL. 13; NO 3; PP. 242-250; BIBL. 6 REF.Serial Issue

A NEW DETERMINATION METHOD OF THE ORDER OF COMPLEXITY FOR A NONRECIPROCAL ELECTRIC CIRCUITIORDACHE M; CHIRA S.1983; REVUE ROUMAINE DES SCIENCES TECHNIQUES. SERIE ELECTROTECHNIQUE ET ENERGETIQUE; ISSN 0035-4066; ROM; DA. 1983; VOL. 28; NO 1; PP. 37-43; BIBL. 6 REF.Article

On 3-connected graphs with contractible edge covers of size kHEMMINGER, R. L; XINGXING YU.Discrete mathematics. 1992, Vol 101, Num 1-3, pp 115-133, issn 0012-365XArticle

The 3-choosability of plane graphs of girth 4LAM, Peter C. B; WAI CHEE SHIU; ZENG MIN SONG et al.Discrete mathematics. 2005, Vol 294, Num 3, pp 297-301, issn 0012-365X, 5 p.Article

Support sizes of sixfold triple systemsCOLBOURN, C. J; MAHMOODIAN, E. S.Discrete mathematics. 1993, Vol 115, Num 1-3, pp 103-131, issn 0012-365XArticle

Dehn fillings on a two torus boundary components 3-manifoldMAYRAND, Elsa.Osaka Journal of Mathematics. 2002, Vol 39, Num 4, pp 779-793, issn 0030-6126, 15 p.Article

Computer storage and retrieval of generic chemical structures in patents. XIII, Graph generationGILLET, V. J; DOWNS, G. M; HOLLIDAY, J. D et al.Journal of chemical information and computer sciences. 1991, Vol 31, Num 2, pp 260-270, issn 0095-2338Article

On approximating the achromatic numberKORTSARZ, Guy; KRAUTHGAMER, Robert.SIAM journal on discrete mathematics (Print). 2001, Vol 14, Num 3, pp 408-422, issn 0895-4801Article