COMPLEXITY OF GRAPH EMBEDDABILITY PROBLEMSBENZAKEN C; FOLDES S.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 15; NO 3; PP. 321-328; BIBL. 8 REF.Article

NOMBRE DE CLASSES DE CONFIGURATIONS ISOTOPES D'UN GRAPHETETEL'BAUM A YA.1980; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; SUN; DA. 1980; NO 3; PP. 200-202; BIBL. 5 REF.Article

ON THE PROBLEM OF PARTITIONING PLANAR GRAPHSDJIDJEV HN.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 2; PP. 229-240; BIBL. 3 REF.Article

ON THE NUMBER OF PLANAR MAPSWORMALD NC.1981; CAN. J. MATH.; ISSN 0008-414X; CAN; DA. 1981; VOL. 33; NO 1; PP. 1-11; BIBL. 15 REF.Article

A NEW APPROACH TO PLANAR POINT LOCATIONPREPARATA FP.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 473-482; BIBL. 17 REF.Article

UEBER SEPARATOREN IN PLANAREN GRAPHEN = SEPARATEURS DANS LES GRAPHES PLANAIRESPHILIPP R; PRAUSS EJ.1980; ACTA INFORMAT.; DEU; DA. 1980; VOL. 14; NO 1; PP. 87-106; ABS. ENG; BIBL. 2 REF.Article

KURATOWSKI-PONTRJAGIN THEOREM ON PLANAR GRAPHS.BURSTEIN M.1978; J. COMBINATOR, THEORY, B; U.S.A.; DA. 1978; VOL. 24; NO 2; PP. 228-232; BIBL. 5 REF.Article

SOME 4-VALENT, 3-CONNECTED, PLANAR, ALMOST PANCYCLIC GRAPHS.CHOUDUM SA.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 18; NO 2; PP. 125-129; BIBL. 3 REF.Article

TEST D'ISOMORPHIE DE DEUX GRAPHES PLANAIRES.FONTET M.1976; IN: ANAL. APPL. INF. JOURN. COMB. INF.; BORDEAUX; 1975; BORDEAUX; UNIV. BORDEAUX I; DA. 1976; PP. 125-137; ABS. ANGL.; BIBL. 1 P. 1/2Conference Paper

UN CODE DES GRAPHES PLANAIRES ET SON UTILISATION POUR TESTER L'ISOMORPHISME.FRANCHI P; VAUQUELIN B.1976; IN: ANAL. APPL. INF. JOURN. COMB. INF.; BORDEAUX; 1975; BORDEAUX; UNIV. BORDEAUX I; DA. 1976; PP. 181-188; BIBL. 9 REF.Conference Paper

A THEOREM ON PLANAR GRAPHS.LITTLE CHC.1976; LECTURE NOTES MATH.; GERM.; DA. 1976; NO 560; PP. 136-141; BIBL. 4 REF.; (COMB. MATH. AUST. CONF. 4. PROC.; ADELAIDE; 1975)Conference Paper

COUNTING ROOTED TRIANGULATIONSTUTTE WT.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; VOL. 60; PP. 243-253; BIBL. 5 REF.Article

EIN PLANAXER HYPOHAMILTONSCHER GRAPH MIT 57 KNOTEN = UN GRAPHE HYPOHAMILTONIEN PLANAIRE AVEC 57 NOEUDSHATZEL W.1979; MATH. ANN.; DEU; DA. 1979; VOL. 243; NO 3; PP. 213-216; BIBL. 7 REF.Article

A SEPARATOR THEOREM FOR PLANAR GRAPHSLIPTON RJ; TARJAN RE.1979; S.I.A.M. J. APPL. MATH.; USA; DA. 1979; VOL. 36; NO 2; PP. 177-189; BIBL. 17 REF.Article

ON THE EDGE-RECONSTRUCTION OF PLANAR GRAPHS.FIORINI S.1978; MATH. PROC. CAMBRIDGE PHILOS. SOC.; G.B.; DA. 1978; VOL. 83; NO 1; PP. 31-35; BIBL. 2 REF.Article

A THEOREM ON PLANAR GRAPHS WITH AN APPLICATION TO THE RECONSTRUCTION PROBLEM. I.FIORINI S.1978; QUART. J. MATH.; GBR; DA. 1978; VOL. 29; NO 115; PP. 353-361; BIBL. 3 REF.Article

COMMENTS ON F. HADLOCK'S PAPER: "FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME".AOSHIMA K; IRI M.1977; S.I.A.M. J. COMPTG; U.S.A.; DA. 1977; VOL. 6; NO 1; PP. 86-87; BIBL. 1 REF.Article

PLANAR LATTICES AND PLANAR GRAPHS.PLATT CR.1976; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1976; VOL. 21; NO 1; PP. 30-39; BIBL. 3 REF.Article

MANIPULATION DES CARTES PLANAIRES A PARTIR DE LEUR CODAGE.CORI R; HARDOUIN DUPARC J.1976; IN: ANAL. APPL. INF. JOURN. COMB. INF.; BORDEAUX; 1975; BORDEAUX; UNIV. BORDEAUX I; DA. 1976; PP. 79-102; BIBL. 8 REF.Conference Paper

TENTATIVE DE DESSIN DE GRAPHE PLANAIRE LINEAIRE EN N A PARTIR DE RESULTATS DE HOPCROFT ET TARJAN.SAILLARD JC.1976; IN: ANAL. APPL. INF. JOURN. COMB. INF.; BORDEAUX; 1975; BORDEAUX; UNIV. BORDEAUX I; DA. 1976; PP. 329-337; ABS. ANGL.; BIBL. 3 REF.Conference Paper

UNE C.N.S. POUR QUE LA SOMME CARTESIENNE DE 2 GRAPHES SOIT PLANAIRE.LIOUVILLE B.1976; IN: ANAL. APPL. INF. JOURN. COMB. INF.; BORDEAUX; 1975; BORDEAUX; UNIV. BORDEAUX I; DA. 1976; PP. 253-257; ABS. ANGL.Conference Paper

AN IMPROVED ALGORITHM FOR THE FIXED-RADIUS NEIGHBOR PROBLEMCHAZELLE B.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 4; PP. 193-198; BIBL. 12 REF.Article

THE GEOMETRY OF PLANAR GRAPHSGRUENBAUM B; SHEPHARD GC.1981; LECT. NOTE SER.-LONDON MATH. SOC.; ISSN 0076-0552; GBR; DA. 1981; NO 52; PP. 124-150; BIBL. 3 P.Conference Paper

A COMBINATORIAL CHARACTERIZATION OF PLANAR 2-COMPLEXESGROSS JL; ROSEN RH.1981; COLLOQ. MATH.; ISSN 0010-1354; POL; DA. 1981 PUBL. 1982; VOL. 44; NO 2; PP. 241-247; BIBL. 5 REF.Article

A MULTI-TERMINAL MINIMUM CUT ALGORITHM FOR PLANAR GRAPHSSHILOACH Y.1980; S.I.A.M. J. COMPUTG.; USA; DA. 1980; VOL. 9; NO 2; PP. 219-224; BIBL. 3 REF.Article