REALIZING THE DISTANCE MATRIX OF A GRAPH.NIEMINEN J.1976; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1976; VOL. 12; NO 1-2; PP. 29-31; ABS. ALLEM. RUSSE; BIBL. 2 REF.Article

THE SQUARE OF A BLOCK IS STRONGLY PATH CONNECTED.FAUDREE RJ; SCHELP RH.1976; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1976; VOL. 20; NO 1; PP. 47-61; BIBL. 7 REF.Article

A SHORTEST PATH ALGORITHM FOR EDGE-SPARSE GRAPHS.WAGNER RA.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 1; PP. 50-57; BIBL. 9 REF.Article

PATH CONNECTED GRAPHS.FAUDREE RJ; SCHELP RH.1974; ACTA MATH. ACAD. SCI. HUNGAR.; HONGR.; DA. 1974; VOL. 25; NO 3-4; PP. 313-319; BIBL. 3 REF.Article

THE NUMBER OF MINIMAL LATTICE PATHS RESTRICTED BY TWO PARALLEL LINESSATO M; CONG TT.1983; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1983; VOL. 43; NO 2-3; PP. 249-261; BIBL. 9 REF.Article

UNDECIDED RAMSEY-NUMBER FOR PATHSLINDSTROM B.1983; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1983; VOL. 43; NO 1; PP. 111-112; BIBL. 3 REF.Article

Q-COUNTING N-DIMENSIONAL LATTICE PATHSSULANKE RA.1982; J. COMB. THEORY, SER. A; ISSN 0097-3165; USA; DA. 1982; VOL. 33; NO 2; PP. 135-146; BIBL. 12 REF.Article

UEBER MAXIMALE SYSTEME VON KONTENDISJUNKTEN UNENDLICHEN WEGEN IN GRAPHEN = SUR DES SYSTEMES MAXIMAUX DES PARCOURS INFINIS A ARETE DISJOINTE DANS DES GRAPHESANDREAE T.1981; MATH. NACHR.; ISSN 0323-5572; DDR; DA. 1981; VOL. 101; PP. 219-228; BIBL. 13 REF.Article

GRAPHS WITH UNIQUE WALKS, TRAILS OR PATHS OF GIVEN LENGTHS.BOSAK J.1978; LECTURE NOTES MATH.; GERM.; DA. 1978; NO 642; PP. 75-85; BIBL. 10 REF.; (THEORY APPL. GRAPHS. INT. CONF. PROC.; KALAMAZOO; 1976)Conference Paper

VARIOUS LENGTH PATHS IN GRAPHS.FAUDREE RJ; SCHELP RH.1978; LECTURE NOTES MATH.; GERM.; DA. 1978; NO 642; PP. 160-173; BIBL. 1 P. 1/2; (THEORY APPL. GRAPHS. INT. CONF. PROC.; KALAMAZOO; 1976)Conference Paper

NEW BOUNDS ON THE COMPLEXITY OF THE SHORTEST PATH PROBLEM.FREDMAN ML.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 1; PP. 83-89; BIBL. 12 REF.Article

OPTIMAL LABELLING OF A PRODUCT OF TWO PATHS.CHVATALOVA J.1975; DISCRETE MATH.; NETHERL.; DA. 1975; VOL. 11; NO 3-4; PP. 249-253; BIBL. 5 REF.Article

PATHWAYS AND PITFALLS IN DEVICE LITHOGRAPHY.GORDON EI.1975; IN: INT. ELECTRON DEVICES MEET.; WASHINGTON, D.C.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 3-5; BIBL. 7 REF.Conference Paper

CARACTERISATION DES GRAPHES ADJOINTS HAMILTONIENS.CHIAPPA RA.1975; MATH. JAP.; JAP.; DA. 1975; VOL. 20; SPEC.; PP. 53-56; BIBL. 6 REF.Article

PARTITION DES SOMMETS EN CHEMINS ET SAUTS DANS LES GRAPHES SANS CIRCUIT.HABIB M.1975; ; S.L.; DA. 1975; PP. (123P.); BIBL. 2 P.; (THESE DOCT. 3E CYCLE, SPEC. MATH. APPL., MENTION INF.; PIERRE ET MARIE CURIE PARIS VI)Thesis

RECENT RESULTS ON TREES.HARARY F.1974; LECTURE NOTES MATH.; GERM.; DA. 1974; NO 406; PP. 1-9; BIBL. 11 REF.; (GRAPHS AND COMB. PROC. CAP. CONG. GRAPH THEORY COMB.; WASHINGTON; 1973)Conference Paper

FINDING THE LENGHTS OF ALL SHORTEST PATHS IN N-NODE NONNEGATIVE-DISTANCE COMPLETE NETWORKS USING 1/2N³ ADDITIONS AND N³ COMPARISONSYEN JY.1972; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1972; VOL. 19; NO 3; PP. 423-424; BIBL. 1 REF.Serial Issue

SUR UNE VARIANTE DU PROBLEME DE CONSTRUCTION DU PLUS COURT ITINERAIRE FERME DANS UN GRAPHEZAJTSEVA ZH N; SHTEJN ME.1972; KIBERNETIKA, U.S.S.R; S.S.S.R.; DA. 1972; NO 4; PP. 99-101; BIBL. 4 REF.Serial Issue

EXISTENCE OF DOMINATING CYCLES AND PATHSVELDMAN HJ.1983; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1983; VOL. 43; NO 2-3; PP. 281-296; BIBL. 11 REF.Article

THE BOUNDED PATH TREE PROBLEMCAMERINI PM; GALBIATI G.1982; SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 4; PP. 474-484; BIBL. 10 REF.Conference Paper

TOURNEES DANS LES TOURNOISDARBINYAN S KH.1978; AKAD. NAUK ARM. S.S.R., DOKL.; SUN; DA. 1978; VOL. 66; NO 3; PP. 138-141; ABS. ARM; BIBL. 5 REF.Article

LA CIRCULATION DANS LES GRAPHES TRACES ARBITRAIREMENTGHIUS V; ONCIULENCU I.1976; BUL. INST. POLITEH. IASI, 1; ROMAN.; DA. 1976; VOL. 22; NO 3-4; PP. 57-60; ABS. FR.; BIBL. 2 REF.Article

AN ALGORITHM FOR FINDING ALL SHORTEST PATHS USING N^2.81 INFINITE-PRECISION MULTIPLICATIONS.YUVAL G.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 4; NO 6; PP. 155-156; BIBL. 4 REF.Article

PARALLEL COMPUTATIONS IN GRAPH THEORY.ESHRAT ARJOMANDI; CORNEIL DG.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 13-18; BIBL. 11 REF.Conference Paper

ALGEBRE DES CHEMINS ET ALGORITHMES.GONDRAN M.1975; ELECTR. FR., BULL. DIRECT. ET. RECH., C; FR.; DA. 1975; NO 2; PP. 57-64; ABS. ANGL.; BIBL. 19 REF.Article